![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
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 23 matches
- 2002
- Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled
, Mark H. Overmars, Micha Sharir, Jan Vahrenhold:
Reporting intersecting pairs of convex polytopes in two and three dimensions. Comput. Geom. 23(2): 195-207 (2002) - Tetsuo Asano, Antonio Hernández-Barrera, Subhas C. Nandy:
Translating a convex polyhedron over monotone polyhedra. Comput. Geom. 23(3): 257-269 (2002) - Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen
, Jules Vleugels:
Models and motion planning. Comput. Geom. 23(1): 53-68 (2002) - Sergei Bespamyatnikh:
Packing two disks in a polygon. Comput. Geom. 23(1): 31-42 (2002) - Sergei Bespamyatnikh:
An efficient algorithm for enumeration of triangulations. Comput. Geom. 23(3): 271-279 (2002) - Binay K. Bhattacharya, Gautam Das
, Asish Mukhopadhyay, Giri Narasimhan
:
Optimally computing a shortest weakly visible line segment inside a simple polygon. Comput. Geom. 23(1): 1-29 (2002) - Prosenjit Bose
:
On embedding an outer-planar graph in a point set. Comput. Geom. 23(3): 303-312 (2002) - Prosenjit Bose
, Anna Lubiw, J. Ian Munro:
Efficient visibility queries in simple polygons. Comput. Geom. 23(3): 313-335 (2002) - José Cáceres, Alberto Márquez:
An aperiodic tiles machine. Comput. Geom. 23(2): 171-182 (2002) - Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia:
Optimizing area and aspect ration in straight-line orthogonal tree drawings. Comput. Geom. 23(2): 153-162 (2002) - Siu-Wing Cheng
, Kam-Hing Lee:
Quadtree, ray shooting and approximate minimum weight Steiner triangulation. Comput. Geom. 23(2): 99-116 (2002) - David Eppstein:
Beta-skeletons have unbounded dilation. Comput. Geom. 23(1): 43-52 (2002) - Thomas Erlebach, Jirí Fiala:
On-line coloring of geometric intersection graphs. Comput. Geom. 23(2): 243-255 (2002) - Daniel Freedman:
Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited. Comput. Geom. 23(2): 227-241 (2002) - Joachim Gudmundsson
, Mikael Hammar, Marc J. van Kreveld:
Higher order Delaunay triangulations. Comput. Geom. 23(1): 85-98 (2002) - Dan Halperin, Eli Packer:
Iterated snap rounding. Comput. Geom. 23(2): 209-225 (2002) - Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram:
A decomposition-based approach to layered manufacturing. Comput. Geom. 23(2): 117-151 (2002) - L. Jackson, Stephen K. Wismath:
Orthogonal polygon reconstruction from stabbing information. Comput. Geom. 23(1): 69-83 (2002) - Volker Kaibel, Marc E. Pfetsch
:
Computing the face lattice of a polytope from its vertex-facet incidences. Comput. Geom. 23(3): 281-290 (2002) - Mario Alberto López, Shlomo Reisner:
Linear time approximation of 3D convex polytopes. Comput. Geom. 23(3): 291-301 (2002) - Jean-Marie Morvan, Boris Thibert:
On the approximation of a smooth surface with a triangulated mesh. Comput. Geom. 23(3): 337-352 (2002) - Hyeon-Suk Na, Chung-Nim Lee, Otfried Cheong
:
Voronoi diagrams on the spher. Comput. Geom. 23(2): 183-194 (2002) - Pawel Winter:
Optimal Steiner hull algorithm. Comput. Geom. 23(2): 163-169 (2002)
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-08-29 04: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