Остановите войну!
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 56 matches
- 1999
- Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir:
Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. SCG 1999: 380-389 - Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger:
Lower Bounds for Kinetic Planar Subdivisions. SCG 1999: 247-254 - Pankaj K. Agarwal, Micha Sharir:
Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions. SCG 1999: 143-153 - Oswin Aichholzer:
The Path of a Triangulation. SCG 1999: 14-23 - Nina Amenta:
The Crust Algorithm for 3D Surface Reconstruction. SCG 1999: 423-424 - Richard J. Anderson, Sumeet Sobti:
The Table Layout Problem. SCG 1999: 115-123 - Boris Aronov, Tamal K. Dey:
Polytopes in Arrangements. SCG 1999: 154-162 - Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki:
Spanning Trees Crossing Few Barriers. SCG 1999: 41-48 - Chandrajit L. Bajaj, Guoliang Xu:
Error Bounded Regular Algebraic Spline Curves. SCG 1999: 332-340 - Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Subodh Kumar, Mihai Pop:
Efficient Perspective-Accurate Silhouette Computation. SCG 1999: 417-418 - Julien Basch, João Comba, Leonidas J. Guibas, John Hershberger, Craig Silverstein, Li Zhang:
Kinetic Data Structures: Animating Proofs Through Time. SCG 1999: 427-428 - Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen:
Geometric Algorithms for Trap Design. SCG 1999: 95-104 - Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink:
Generalizing Ham Sandwich Cuts to Equitable Subdivisions. SCG 1999: 49-58 - Jean-Daniel Boissonnat, Frédéric Cazals, Frank Da, Olivier Devillers, Sylvain Pion, François Rebufat, Monique Teillaud, Mariette Yvinec:
Programming with CGAL: The Example of Triangulations. SCG 1999: 421-422 - Jean-Daniel Boissonnat, Jack Snoeyink:
Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates. SCG 1999: 370-379 - Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra:
Efficient Exact Geometric Computation Made Easy. SCG 1999: 341-350 - Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Xiaodong Wu, Jinhui Xu:
Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. SCG 1999: 322-331 - Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng:
Sliver Exudation. SCG 1999: 1-13 - Siu-Wing Cheng, Hazel Everett, Otfried Cheong, René van Oostrum:
Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons. SCG 1999: 227-236 - Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke, Irena Pashchenko:
Metamorphosis of the Cube. SCG 1999: 409-410 - Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell:
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami. SCG 1999: 105-114 - Olivier Devillers:
On Deletion in Delaunay Triangulations. SCG 1999: 181-188 - Tamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos:
Curve Reconstruction: Connecting Dots with Good Reason. SCG 1999: 197-206 - David P. Dobkin, Alejo Hausner, Emden R. Gansner, Stephen C. North:
Uncluttering Force-Directed Graph Layouts. SCG 1999: 425-426 - Herbert Edelsbrunner, Daniel R. Grayson:
Edgewise Subdivision of a Simplex. SCG 1999: 24-30 - Alon Efrat:
The Complexity of the Union of (alpha, beta)-Covered Objects. SCG 1999: 134-142 - Sándor P. Fekete, Henk Meijer:
On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings. SCG 1999: 217-226 - Steven Fortune:
Topological Beam Tracing. SCG 1999: 59-68 - Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian:
Geometric Pattern Matching: A Performance Study. SCG 1999: 79-85 - Joachim Giesen:
Curve Reconstruction, the Traveling Salesman Problem and Menger's Theorem on Length. SCG 1999: 207-216
skipping 26 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-27 19:58 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