Остановите войну!
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 39 matches
- 1987
- Alok Aggarwal, Subhash Suri:
Fast Algorithms for Computing the Largest Empty Rectangle. SCG 1987: 278-290 - Panagiotis Alevizos, Jean-Daniel Boissonnat, Mariette Yvinec:
An Optimal O(n log n) Algorithm for Contour Reconstruction from Rays. SCG 1987: 162-170 - Noga Alon, David Haussler, Emo Welzl:
Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension. SCG 1987: 331-340 - Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl:
Congruence, Similarity, and Symmetries of Geometric Objects. SCG 1987: 308-315 - Boris Aronov:
On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon. SCG 1987: 39-49 - Franz Aurenhammer:
Jordan Sorting Via Convex Hulls of Certain Non-Simple Polygons. SCG 1987: 21-29 - David Avis, Rephael Wenger:
Algorithms for Line Transversals in Space. SCG 1987: 300-307 - Francis Avnaim, Jean-Daniel Boissonnat:
Simultaneous Containment of Several Polygons. SCG 1987: 242-247 - Chandrajit L. Bajaj, Myung-Soo Kim:
Compliant Motion Planning with Geometric Models. SCG 1987: 171-180 - John F. Canny, Bruce Randall Donald:
Simplified Voronoi Diagrams. SCG 1987: 153-161 - L. Paul Chew:
Constrained Delaunay Triangulations. SCG 1987: 215-222 - Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya:
Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time. SCG 1987: 251-257 - Norm Dadoun, David G. Kirkpatrick:
Parallel Processing for Efficient Subdivision Search. SCG 1987: 205-214 - Michael B. Dillencourt:
Toughness and Delaunay Triangulations. SCG 1987: 186-194 - David P. Dobkin, Michael J. Laszlo:
Primitives for the Manipulation of Three-Dimensional Subdivisions. SCG 1987: 86-99 - Robert L. (Scot) Drysdale III, Robert B. Jerard:
Discrete Simulation of NC Machining. SCG 1987: 126-135 - Masato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano:
A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency. SCG 1987: 258-267 - Leila De Floriani:
A Graph Based Approach to Object Feature Recognition. SCG 1987: 100-109 - Wm. Randolph Franklin:
Polygon Properties Calculated from the Vertex Neighborhoods. SCG 1987: 110-118 - Leonidas J. Guibas, John Hershberger:
Optimal Shortest Path Queries in a Simple Polygon. SCG 1987: 50-63 - John Hershberger:
Finding the Visibility Graph of a Simple Polygon in Time Proportional to its Size. SCG 1987: 11-20 - Jerzy W. Jaromczyk, Miroslaw Kowaluk:
A Note on Relative Neighborhood Graphs. SCG 1987: 233-241 - Yan Ke, Joseph O'Rourke:
Moving a Ladder in Three Dimensions: Upper and Lower Bounds. SCG 1987: 136-146 - David G. Kirkpatrick:
Establishing Order in Planar Subdivisions. SCG 1987: 316-321 - William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap:
Computing the Link Center of a Simple Polygon. SCG 1987: 1-10 - Joseph S. B. Mitchell, Christos H. Papadimitriou:
The Weighted Region Problem. SCG 1987: 30-38 - J. Ian Munro, Mark H. Overmars, Derick Wood:
Variations on Visibility. SCG 1987: 291-299 - B. K. Natarajan:
On Detecting the Orientation of Polygons and Polyhedra. SCG 1987: 147-152 - Thomas Ottmann, Gerald Thiemt, Christian P. Ullrich:
Numerical Stability of Geometric Algorithms. SCG 1987: 119-125 - David Rappaport:
Computing Simple Circuits from a Set of Line Segments is NP-Complete. SCG 1987: 322-330
skipping 9 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-31 07:15 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