Остановите войну!
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 44 matches
- 2002
- Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser:
On the crossing number of complete graphs. SCG 2002: 19-24 - Oswin Aichholzer, Franz Aurenhammer, Belén Palop:
Quickest paths, straight skeletons, and the city Voronoi diagram. SCG 2002: 151-159 - Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang:
Cost prediction for ray shooting. SCG 2002: 293-302 - Boris Aronov, Vladlen Koltun, Micha Sharir:
Incidences between points and circles in three and higher dimensions. SCG 2002: 116-122 - Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap:
Pseudo approximation algorithms, with applications to optimal motion planning. SCG 2002: 170-178 - Boaz Ben-Moshe, Joseph S. B. Mitchell, Matthew J. Katz, Yuval Nir:
Visibility preserving terrain simplification: an experimental study. SCG 2002: 303-311 - Marshall W. Bern, David Goldberg:
Paper position sensing. SCG 2002: 74-81 - Alexander Bogomjakov, Craig Gotsman:
AUTO-FOLLOW: getting a piece of the action all the time. SCG 2002: 279-280 - Ciprian Borcea, Ileana Streinu:
On the number of embeddings of minimally rigid graphs. SCG 2002: 25-32 - Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink:
Testing Homotopy for paths in the plane. SCG 2002: 160-169 - Bernard Chazelle:
The power of nonmonotonicity in geometric searching. SCG 2002: 88-93 - Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek:
The one-round Voronoi game. SCG 2002: 97-101 - L. Paul Chew, Klara Kedem:
Finding the consensus shape for a protein family. SCG 2002: 64-73 - Sunghee Choi:
The Delaunay tetrahedralization from Delaunay triangulated surfaces Sunghee Choi. SCG 2002: 145-150 - David Cohen-Steiner, Éric Colin de Verdière, Mariette Yvinec:
Conforming Delaunay triangulations in 3D. SCG 2002: 199-208 - Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke:
Vertex-unfoldings of simplicial manifolds. SCG 2002: 237-243 - Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink:
Interlocked open linkages with few joints. SCG 2002: 189-198 - Alon Efrat, Stephen G. Kobourov, Michael Stepp, Carola Wenk:
Growing fat graphs. SCG 2002: 277-278 - Jeff Erickson, Sariel Har-Peled:
Optimally cutting a surface into a disk. SCG 2002: 244-253 - Regina Estkowski, Joseph S. B. Mitchell, Xinyu Xiang:
Optimal decomposition of polygonal models into triangle strips. SCG 2002: 254-263 - Eyal Flato, Efi Fogel, Dan Halperin, Eran Leiserowitz:
Exact minkowski sums and applications. SCG 2002: 273-274 - David Goldberg, Christopher Malon, Marshall W. Bern:
A global approach to automatic solution of jigsaw puzzles. SCG 2002: 82-87 - Mordecai J. Golin, Hyeon-Suk Na:
The probabilistic complexity of the Voronoi diagram of points on a polyhedron. SCG 2002: 209-216 - Leonidas J. Guibas, An Thanh Nguyen, Daniel Russel, Li Zhang:
Collision detection for deforming necklaces. SCG 2002: 33-42 - Igor Guskov, Andrei Khodakovsky, Peter Schröder, Wim Sweldens:
Hybrid meshes: multiresolution using regular and irregular refinement. SCG 2002: 264-272 - Sariel Har-Peled, Kasturi R. Varadarajan:
Projective clustering in high dimensions using core-sets. SCG 2002: 312-318 - Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson:
Box-trees for collision checking in industrial installations. SCG 2002: 53-62 - Piotr Indyk:
Approximate nearest neighbor algorithms for Frechet distance via product metrics. SCG 2002: 102-106 - Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu:
A local search approximation algorithm for k-means clustering. SCG 2002: 10-18 - David G. Kirkpatrick, Bettina Speckmann:
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons. SCG 2002: 179-188
skipping 14 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-04 09:12 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