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 58 matches
- 2004
- Reza Abedi, Shuo-Heng Chung, Jeff Erickson, Yong Fan, Michael Garland, Damrong Guoy, Robert B. Haber, John M. Sullivan, Shripad Thite, Yuan Zhou:
Spacetime meshing with adaptive refinement and coarsening. SCG 2004: 300-309 - Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir:
On lines avoiding unit balls in three dimensions. SCG 2004: 36-45 - Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang:
Extreme elevation on a 2-manifold. SCG 2004: 357-365 - Pankaj K. Agarwal, Micha Sharir, Emo Welzl:
Algorithms for center and Tverberg points. SCG 2004: 61-67 - Pankaj K. Agarwal, Kasturi R. Varadarajan:
A near-linear constant-factor approximation for euclidean bipartite matching? SCG 2004: 247-252 - Pankaj K. Agarwal, Yusu Wang, Hai Yu:
A 2D kinetic triangulation with near-quadratic topological changes. SCG 2004: 180-189 - Russel A. Apu, Marina L. Gavrilova:
Adaptive mesh generation for real-time terrain modeling. SCG 2004: 447-448 - Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir:
On the union of kapa-round objects. SCG 2004: 383-390 - Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk:
Low-dimensional embedding with extra information. SCG 2004: 320-329 - Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich:
Deterministic sampling and range counting in geometric data streams. SCG 2004: 144-151 - Ilya Baran, Erik D. Demaine:
Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve. SCG 2004: 220-229 - Boaz Ben-Moshe, Olaf A. Hall-Holt, Matthew J. Katz, Joseph S. B. Mitchell:
Computing the visibility graph of points within a polygon. SCG 2004: 27-35 - Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin:
Geodesic ham-sandwich cuts. SCG 2004: 1-9 - Hervé Brönnimann, Timothy M. Chan, Eric Y. Chen:
Towards in-place geometric algorithms and data structures. SCG 2004: 239-246 - Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
The number of lines tangent to arbitrary convex polyhedra in 3D. SCG 2004: 46-55 - Jason H. Cantarella, Erik D. Demaine, Hayley N. Iben, James F. O'Brien:
An energy-driven approach to linkage unfolding. SCG 2004: 134-143 - David E. Cardoze, Alexandre Cunha, Gary L. Miller, Todd Phillips, Noel Walkington:
A Bézier-based approach to unstructured moving meshes. SCG 2004: 310-319 - Timothy M. Chan:
Faster core-set constructions and data stream algorithms in fixed dimensions. SCG 2004: 152-159 - Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tathagata Ray:
Sampling and meshing a surface with guaranteed topology and geometry. SCG 2004: 280-289 - Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tathagata Ray:
Quality meshing for polyhedra with small angles. SCG 2004: 290-299 - Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni:
Locality-sensitive hashing scheme based on p-stable distributions. SCG 2004: 253-262 - Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides:
Separating point sets in polygonal environments. SCG 2004: 10-16 - Olivier Devillers, Philippe Guigue:
Inner and outer rounding of set operations on lattice polygonal regions. SCG 2004: 429-437 - Tamal K. Dey, Samrat Goswami:
Provable surface reconstruction from noisy samples. SCG 2004: 330-339 - Adrian Dumitrescu:
On distinct distances from a vertex of a convex polygon. SCG 2004: 57-60 - Adrian Dumitrescu, János Pach:
Pushing squares around. SCG 2004: 116-123 - Christian A. Duncan, David Eppstein, Stephen G. Kobourov:
The geometric thickness of low degree graphs. SCG 2004: 340-346 - Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci:
Time-varying reeb graphs for continuous space-time data. SCG 2004: 366-372 - Arno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert:
Complete, exact, and efficient computations with cubic curves. SCG 2004: 409-418 - Ioannis Z. Emiris, Athanasios Kakargias, Sylvain Pion, Monique Teillaud, Elias P. Tsigaridas:
Towards and open curved kernel. SCG 2004: 438-446
skipping 28 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-10-20 09:13 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