Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 67 matches
- 1994
- Manuel Abellanas, Jesus Garcia-Lopez, Ferran Hurtado:
Consecutive Guards. CCCG 1994: 393-398 - Manuel Abellanas, Ferran Hurtado, Pedro A. Ramos:
Tolerance of Geometric Structures. CCCG 1994: 250-255 - Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis:
Saving Bits Made Easy. CCCG 1994: 140-146 - Tetsuo Asano, Takeshi Tokuyama:
Topological Walk Revisited. CCCG 1994: 1-6 - Patrice Belleville, Prosenjit Bose, Jurek Czyzowicz, Jorge Urrutia, Joseph Zaks:
K-Guarding Polygons on the Plane. CCCG 1994: 381-386 - Sergei Bespamyatnikh:
The Region Approach for some Dynamic Closest-Point Problems. CCCG 1994: 75-80 - Prosenjit Bose, David Bremner, Godfried T. Toussaint:
All Convex Polyhedra can be Clamped with Parallel Jaw Grippers. CCCG 1994: 344-349 - David Bremner:
Link-2-Convex One-Fillable Polygons are Starshaped. CCCG 1994: 363-368 - Andreas Brinkman, Thorsten Graf, Klaus H. Hinrichs:
The Colored Quadrant Priority Search Tree with an Application to the all-nearest-foreign-neighbors Problem. CCCG 1994: 63-68 - Hervé Brönnimann, Bernard Chazelle:
Optimal Slope Selection Via Cuttings. CCCG 1994: 99-103 - Timothy M. Chan:
A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections. CCCG 1994: 263-268 - Danny Z. Chen:
Determining Weak External Visibility of Polygons in Parallel. CCCG 1994: 375-380 - Siu-Wing Cheng:
Widest Empty Corridor with Multiple Links and Right-angle Turns. CCCG 1994: 57-62 - Paul Colley, Henk Meijer, David Rappaport:
Optimal Nearly-Similar Polygon Stabbers of Convex Polygons. CCCG 1994: 269-274 - Karen L. Daniels, Victor Milenkovic:
Limited Gaps. CCCG 1994: 225-230 - Abhi Dattasharma:
Some Qualitative Properties of a Generalized Voronoi Diagram for Convex Polyhedra in d-dimensions. CCCG 1994: 134-139 - Abhi Dattasharma:
The Size of a Generalized Voronoi Diagram for Convex Polyhedra in d-dimensions. CCCG 1994: 357-362 - Olivier Devillers, Mordecai J. Golin:
Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. CCCG 1994: 153-158 - Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra:
Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. CCCG 1994: 122-127 - Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh:
Triangulating with High Connectivity. CCCG 1994: 339-343 - Michael B. Dillencourt, Warren D. Smith:
Graph-Theoretical Conditions for Inscribability and Delaunay Realizability. CCCG 1994: 287-292 - David P. Dobkin, Ayellet Tal:
GASP - An Animation System for Computational Geometry. CCCG 1994: 243-249 - Herbert Edelsbrunner:
Modeling with Simplicial Complexes. CCCG 1994: 36-44 - Vladimir Estivill-Castro, Jorge Urrutia:
Optimal Floodlight Illumination of Orthogonal Art Galleries. CCCG 1994: 81-86 - Hazel Everett, Eduardo Rivera-Campo:
Edge Guarding a Triangulated Polyhedral Terrain. CCCG 1994: 293-295 - Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao, Jules Vleugels:
Hunting Voronoi Vertices in Non-Polygonal Domains. CCCG 1994: 45-50 - Joseph L. Ganley, James P. Cohoon:
Optimal Rectilinear Steiner Minimal Trees in O (n22.62n) Time. CCCG 1994: 308-313 - Laxmi P. Gewali:
Recognizing S-Star Polygons. CCCG 1994: 183-188 - Christopher M. Gold:
Persistent Spatial Relations - a Systems Design Objective. CCCG 1994: 219-224 - Thorsten Graf, Klaus H. Hinrichs:
Distribution Algorithms for the all-nearest-foreign-neighbors Problem in Arbitrary Lt-metrics. CCCG 1994: 69-74
skipping 37 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-30 16:14 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint