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 35 matches
- 2000
- Lyudmil Aleksandrov, Hristo N. Djidjev, Jörg-Rüdiger Sack:
An O(n log n) Algorithm for Finding a Shortest Central Link Segment. Int. J. Comput. Geom. Appl. 10(2): 157-188 (2000) - Lars-Erik Andersson, Thomas J. Peters, Neil F. Stewart:
Equivalence of Topological Form for Curvilinear Geometric Objects. Int. J. Comput. Geom. Appl. 10(6): 609-622 (2000) - Nakhoon Baek, Sung Yong Shin, Kyung-Yong Chwa:
Three-Dimensional Topological Sweep for Computing Rotational Swept Volumes of Polyhedral Objects. Int. J. Comput. Geom. Appl. 10(2): 131-156 (2000) - Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara:
Drawing Directed Acyclic Graphs: An Experimental Study. Int. J. Comput. Geom. Appl. 10(6): 623-648 (2000) - Boaz Ben-Moshe, Matthew J. Katz, Michael Segal:
Obnoxious Facility Location: Complete Service with Minimal Harm. Int. J. Comput. Geom. Appl. 10(6): 581-592 (2000) - Marshall W. Bern, David Eppstein:
Quadrilateral Meshing by Circle Packing. Int. J. Comput. Geom. Appl. 10(4): 347-360 (2000) - Martin Berzins:
Solution-Based Mesh Quality Indicators for Triangular and Tetrahedral Meshes. Int. J. Comput. Geom. Appl. 10(3): 333-346 (2000) - Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir:
Optimal Facility Location Under Various Distance Functions. Int. J. Comput. Geom. Appl. 10(5): 523-534 (2000) - Therese C. Biedl, Brendan Madden, Ioannis G. Tollis:
The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing. Int. J. Comput. Geom. Appl. 10(6): 553-580 (2000) - Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec:
Computing Largest Circles Separating Two Sets of Segments. Int. J. Comput. Geom. Appl. 10(1): 41-53 (2000) - David Bremner, Thomas C. Shermer:
Point Visibility Graphs and O-Convex Cover. Int. J. Comput. Geom. Appl. 10(1): 55-71 (2000) - Erik D. Demaine, Joseph O'Rourke:
Computational Geometry Column 37. Int. J. Comput. Geom. Appl. 10(1): 103-107 (2000) - Herbert Edelsbrunner, Roman Waupotitsch:
Adaptive Simplicial Grids from Cross-Sections of Monotone Complexes. Int. J. Comput. Geom. Appl. 10(3): 267-284 (2000) - Lori A. Freitag, Carl Ollivier-Gooch:
A Cost/Benefit Analysis of Simplicial Mesh Improvement Techniques as Measured by Solution Efficiency. Int. J. Comput. Geom. Appl. 10(4): 361-382 (2000) - Atsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto:
Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane. Int. J. Comput. Geom. Appl. 10(1): 73-78 (2000) - J. Mark Keil, David M. Mount, Stephen K. Wismath:
Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time. Int. J. Comput. Geom. Appl. 10(5): 535-552 (2000) - Jae-Ha Lee, Sang-Min Park, Kyung-Yong Chwa:
Searching a Polygonal Room with One Door by a 1-Searcher. Int. J. Comput. Geom. Appl. 10(2): 201-220 (2000) - Mario Alberto López, Shlomo Reisner:
Efficient Approximation of Convex Polygons. Int. J. Comput. Geom. Appl. 10(5): 445-452 (2000) - Cláudio Nogueira de Meneses, Cid C. de Souza:
Exact Solutions of Rectangular Partitions via Integer Programming. Int. J. Comput. Geom. Appl. 10(5): 477-522 (2000) - Scott A. Mitchell:
High Fidelity Interval Assignment. Int. J. Comput. Geom. Appl. 10(4): 399-415 (2000) - David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu:
Quantile Approximation for Robust Statistical Estimation and k-Enclosing Problems. Int. J. Comput. Geom. Appl. 10(6): 593-608 (2000) - Matthias Müller-Hannemann:
High Quality Quadrilateral Surface Meshing Without Template Restrictions: A New Approach Based on Network Flow Techniques. Int. J. Comput. Geom. Appl. 10(3): 285-307 (2000) - Matthias Müller-Hannemann, Karsten Weihe:
Quadrangular Refinements of Convex Polygons with an Application to Finite-Element Meshes. Int. J. Comput. Geom. Appl. 10(1): 1-40 (2000) - Colm Ó'Dúnlaing, Colum Watt, David Wilkins:
Homeomorphism of 2-Complexes is Equivalent to Graph Isomorphism. Int. J. Comput. Geom. Appl. 10(5): 453-476 (2000) - Joseph O'Rourke:
Computational Geometry Column 38. Int. J. Comput. Geom. Appl. 10(2): 221-223 (2000) - Joseph O'Rourke:
Computational Geometry Column 39. Int. J. Comput. Geom. Appl. 10(4): 441-444 (2000) - Joseph O'Rourke:
Computational Geometry Column 40. Int. J. Comput. Geom. Appl. 10(6): 649-651 (2000) - Helmut Ratschek, Jon G. Rokne:
Exact and Optimal Convex Hulls in 2D. Int. J. Comput. Geom. Appl. 10(2): 109-129 (2000) - Robert Schneiders:
Octree-Based Hexahedral Mesh Generation. Int. J. Comput. Geom. Appl. 10(4): 383-398 (2000) - Alla Sheffer, Michel Bercovier, Ted D. Blacker, Jan Clements:
Virtual Topology Operators for Meshing. Int. J. Comput. Geom. Appl. 10(3): 309-331 (2000)
skipping 5 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 2025-01-03 03:49 CET 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