Остановите войну!
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 43 matches
- 1991
- Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars:
Intersection Queries for Curved Objects (Extended Abstract). SCG 1991: 41-50 - Pankaj K. Agarwal, Micha Sharir:
Counting Circular Arc Intersections. SCG 1991: 10-20 - Helmut Alt, Bernd Behrends, Johannes Blömer:
Approximate Matching of Polygonal Shapes (Extended Abstract). SCG 1991: 186-193 - Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor:
Arrangements of Segments that Share Endpoints: Single Face Results. SCG 1991: 324-333 - Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman:
Crossing Families. SCG 1991: 351-356 - Boris Aronov, Jirí Matousek, Micha Sharir:
On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. SCG 1991: 307-313 - Boris Aronov, Joseph O'Rourke:
Nonoverlap of the Star Unfolding. SCG 1991: 105-114 - Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama:
Walking on an Arrangement Topologically. SCG 1991: 297-306 - Franz Aurenhammer, Otfried Schwarzkopf:
A Simple On-Line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams. SCG 1991: 142-151 - David Avis, Komei Fukuda:
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. SCG 1991: 98-104 - Antal Balog, Imre Bárány:
On the Convex Hull of the Integer Points in a Disc. SCG 1991: 162-165 - Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld:
Efficient Ray Shooting and Hidden Surface Removal. SCG 1991: 21-30 - Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson:
Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). SCG 1991: 51-60 - Marshall W. Bern, David Eppstein:
Polynomial-Size Nonobtuse Triangulation of Polygons. SCG 1991: 342-350 - Paola Bertolazzi, Giuseppe Di Battista:
On Upward Drawing Testing of Triconnected Digraphs (Extended Abstract). SCG 1991: 272-280 - Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Ivan Stojmenovic, Godfried T. Toussaint, Jorge Urrutia:
Computing Shortest Transversals of Sets (Extended Abstract). SCG 1991: 71-80 - Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, Jean-Marc Robert:
Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract). SCG 1991: 81-88 - Yi-Jen Chiang, Roberto Tamassia:
Dynamization of the Trapezoid Method for Planar Point Location (Extended Abstract). SCG 1991: 61-70 - Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan:
Randomized Parallel Algorithms for Trapezoidal Diagrams. SCG 1991: 152-161 - Collette R. Coullard, Anna Lubiw:
Distance Visibility Graphs. SCG 1991: 289-296 - H. S. M. Coxeter:
Orthogonal Trees. SCG 1991: 89-97 - Tamal K. Dey:
Triangulation and CSG Representation of Polyhedra with Arbitrary Genus. SCG 1991: 364-371 - Matthew Dickerson, Robert L. (Scot) Drysdale III:
Enumerating k Distances for n Points in the Plane. SCG 1991: 234-238 - Michael Formann, Frank Wagner:
A Packing Problem with Applications to Lettering of Maps. SCG 1991: 281-288 - Steven Fortune, Victor Milenkovic:
Numerical Stability of Algorithms for Line Arrangements. SCG 1991: 334-341 - Dan Halperin:
On the Complexity of a Single Cell in Certain Arrangements of Surfaces in 3-Space (Extended Abstract). SCG 1991: 314-323 - Daniel P. Huttenlocher, Klara Kedem, Micha Sharir:
The Upper Envelope of Voronoi Surfaces and Its Applications. SCG 1991: 194-203 - Christian Icking, Rolf Klein:
The Two Guards Problem. SCG 1991: 166-175 - Matthew J. Katz, Mark H. Overmars, Micha Sharir:
Efficient Hidden Surface Removal for Objects with small Union Size. SCG 1991: 31-40 - Claire Kenyon, Richard W. Kenyon:
How to Take Short Cuts. SCG 1991: 250-255
skipping 13 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-16 16:20 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