Остановите войну!
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 41 matches
- 1988
- Pankaj K. Agarwal, Micha Sharir:
Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. SCG 1988: 70-80 - Boris Aronov, Steven Fortune, Gordon T. Wilfong:
The Furthest-Site Geodesic Voronoi Diagram. SCG 1988: 229-240 - Boris Aronov, Micha Sharir:
Triangles in Space or Building (and Analyzing) Castles in the Air. SCG 1988: 381-391 - Tetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao:
Clustering Algorithms Based on Minimum and Maximum Spanning Trees. SCG 1988: 252-257 - Marshall W. Bern:
Hidden Surface Removal for Rectangles. SCG 1988: 183-192 - Bruno Buchberger:
Algebraic Methods for Non-Linear Computational Geometry (Invited Address). SCG 1988: 81-82 - Kenneth L. Clarkson:
Applications of Random Sampling in Computational Geometry, II. SCG 1988: 1-11 - Kenneth L. Clarkson, Peter W. Shor:
Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental. SCG 1988: 12-17 - Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk:
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. SCG 1988: 18-22 - Richard Cole, Michael T. Goodrich:
Optimal Parallel Algorithms for Polygon and Point-Set Problems. SCG 1988: 201-210 - David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars:
Searching for Empty Convex Polygons. SCG 1988: 224-228 - David P. Dobkin, Deborah Silver:
Recipes for Geometry and Numerical Analysis - Part I: An Empirical Study. SCG 1988: 93-105 - Bruce Randall Donald:
The Complexity of Planar Compliant Motion Planning Under Uncertainty. SCG 1988: 309-318 - Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink:
On Arrangements of Jordan Arcs with Three Intersections per Pair. SCG 1988: 258-265 - Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl:
Implicitly Representing Arrangements of Lines or Segments. SCG 1988: 56-69 - Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
The Complexity of Many Faces in Arrangements of Lines and of Segments. SCG 1988: 44-55 - Herbert Edelsbrunner, Ernst P. Mücke:
Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms. SCG 1988: 118-133 - L. W. Ericson, Chee-Keng Yap:
The Design of LINETOOL, a Geometric Editor. SCG 1988: 83-92 - Shaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling:
On Continuous Homotopic One Layer Routing. SCG 1988: 392-402 - Laxmi P. Gewali, Alex C. Meng, Joseph S. B. Mitchell, Simeon C. Ntafos:
Path Planning in 0/1/infinity Weighted Regions with Applications. SCG 1988: 266-278 - Mordecai J. Golin, Robert Sedgewick:
Analysis of a Simple Yet Efficient Convex Hull Algorithm. SCG 1988: 153-163 - Leonidas J. Guibas, Micha Sharir, Shmuel Sifrony:
On the General Motion Planning Problem with Two Degrees of Freedom. SCG 1988: 289-298 - Christoph M. Hoffmann, John E. Hopcroft, Michael S. Karasick:
Towards Implementing Robust Geometric Computations. SCG 1988: 106-117 - Jerzy W. Jaromczyk, Miroslaw Kowaluk:
Skewed Projections with an Application to Line Stabbing in R3. SCG 1988: 362-370 - Sanjiv Kapoor, S. N. Maheshwari:
Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles. SCG 1988: 172-182 - Klara Kedem, Micha Sharir:
An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space. SCG 1988: 329-340 - Michael McKenna, Joseph O'Rourke:
Arrangements of Lines in 3-Space: A Data Structure with Applications. SCG 1988: 371-380 - Joseph S. B. Mitchell:
On Maximum Flows in Polyhedral Domains. SCG 1988: 341-351 - Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao:
Computing Euclidean Maximum Spanning Trees. SCG 1988: 241-251 - Rajeev Motwani, Arvind Raghunathan, Huzur Saran:
Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach. SCG 1988: 211-223
skipping 11 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-06-06 13:27 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