![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/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 18 matches
- 1999
- Sunil Arya, David M. Mount, Michiel H. M. Smid:
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Comput. Geom. 13(2): 91-107 (1999) - Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers
, Jean-Marc Robert, Mariette Yvinec:
Convex tours of bounded curvature. Comput. Geom. 13(3): 149-159 (1999) - Timothy M. Chan:
More planar two-center algorithms. Comput. Geom. 13(3): 189-198 (1999) - Amitava Datta
, Christian Icking:
Competitive searching in a generalized street. Comput. Geom. 13(2): 109-120 (1999) - Olivier Devillers
, Franco P. Preparata:
Further results on arithmetic filters for geometric predicates. Comput. Geom. 13(2): 141-148 (1999) - Dorit Dor, Uri Zwick
:
SOKOBAN and other motion planning problems. Comput. Geom. 13(4): 215-228 (1999) - James D. Fix, Richard E. Ladner
:
Multiresolution banded refinement to accelerate surface reconstruction from polygons. Comput. Geom. 13(1): 49-64 (1999) - Bernd Gärtner:
Exact arithmetic at low cost - A case study in linear programming. Comput. Geom. 13(2): 121-139 (1999) - John D. Hobby:
Practical segment intersection with finite precision output. Comput. Geom. 13(4): 199-214 (1999) - Ferran Hurtado, Marc Noy:
Graph of triangulations of a convex polygon and tree of triangulations. Comput. Geom. 13(3): 179-188 (1999) - Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince
:
On representations of some thickness-two graphs. Comput. Geom. 13(3): 161-171 (1999) - Atsushi Kaneko, Mikio Kano:
Balanced partitions of two sets of points in the plane. Comput. Geom. 13(4): 253-261 (1999) - Lutz Kettner:
Using generic programming for designing a data structure for polyhedral surfaces. Comput. Geom. 13(1): 65-90 (1999) - Marc J. van Kreveld, Tycho Strijk, Alexander Wolff:
Point labeling with sliding labels. Comput. Geom. 13(1): 21-47 (1999) - Jayanth Majhi, Prosenjit Gupta, Ravi Janardan:
Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. Comput. Geom. 13(4): 229-252 (1999) - Victor Milenkovic:
Rotational polygon containment and minimum enclosure using only robust 2D constructions. Comput. Geom. 13(1): 3-19 (1999) - Jarek Rossignac:
Editorial. Comput. Geom. 13(1): 1 (1999) - Masatsugu Urabe:
Partitioning point sets in space into disjoint convex polytopes. Comput. Geom. 13(3): 173-178 (1999)
loading more results
failed to load more results, please try again later
![](https://dblp.org/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-09-06 14:18 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