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 24 matches
- 1991
- Franz Aurenhammer, Gerd Stöckl, Emo Welzl:
The Post Office Problem for Fuzzy Point Sets. Workshop on Computational Geometry 1991: 1-11 - Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer:
An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles. Workshop on Computational Geometry 1991: 13-25 - Hanspeter Bieri, Peter-Michael Schmidt:
An On-Line Algorithm for Constructing Sweep Planes in Regular Position. Workshop on Computational Geometry 1991: 27-35 - Salvador Dominguez, Oliver Günther:
Performance Analysis of Three Curve Presentation Schemes. Workshop on Computational Geometry 1991: 37-56 - Martin J. Dürst:
Preclassification and Delayed Classification of Boundary Entities in Arbitrary Dimensions. Workshop on Computational Geometry 1991: 57-69 - Peter Engel:
On the Morphology of Polytoped in Rd. Workshop on Computational Geometry 1991: 71-83 - Shiaofen Fang, Beat D. Brüderlin:
Robustness in Geometric Modeling - Tolerance-Based Methods. Workshop on Computational Geometry 1991: 85-101 - Edmund Ihler, Gabriele Reich, Peter Widmayer:
On Shortest Networks for Classes of Points in the Plane. Workshop on Computational Geometry 1991: 103-111 - Xiaoyi Jiang, Horst Bunke:
Determination of the Symmetries of Polyhedra and an Application to Object Recognition. Workshop on Computational Geometry 1991: 113-121 - Rolf Klein:
Moving Along a Street. Workshop on Computational Geometry 1991: 123-140 - Paul-André Monney:
Planar Geometric Reasoning with the Theory of Hints. Workshop on Computational Geometry 1991: 141-159 - Heinrich Müller, Matthias Otte:
Solving Algebraic Systems in Bernstein-Bézier Representation. Workshop on Computational Geometry 1991: 161-169 - Jürg Nievergelt, Peter Schorn, Michele De Lorenzi, Christoph Ammann, Adrian Brüngger:
XYZ: A Project in Experimental Geometric Computation. Workshop on Computational Geometry 1991: 171-186 - Bengt J. Nilsson, Sven Schuierer:
Computing the Rectilinear Link Diameter of a Polygon. Workshop on Computational Geometry 1991: 203-215 - Hartmut Noltemeier:
Layout of Flexible Manufacturing Systems - Selected Problems. Workshop on Computational Geometry 1991: 217-225 - Thomas Roos, Hartmut Noltemeier:
Dynamic Voronoi Diagrams in Motion Planning. Workshop on Computational Geometry 1991: 227-236 - Haijo Schipper:
Generating Triangulations of 2-Manifolds. Workshop on Computational Geometry 1991: 237-248 - Ralf Schneider, Hans-Peter Kriegel:
The TR*-Tree: A New Representation of Polygonal Objects Supporting Spatial Queries and Operations. Workshop on Computational Geometry 1991: 249-263 - Peter Schorn:
Implementing the XYZ GeoBench: A Programming Environment for Geometric Algorithms. Workshop on Computational Geometry 1991: 187-202 - Thomas Schreiber:
A Voronoi Diagram Based Adaptive K-Means-Type Clustering Algorithm for Multidimenstional Weighted Data. Workshop on Computational Geometry 1991: 265-275 - Sven Schuierer, Gregory J. E. Rawlins, Derick Wood:
A Generalization of Staircase Visibility. Workshop on Computational Geometry 1991: 277-287 - Klaus Simon:
A New Simple Linear Algorithm to Recognize Interval Graphs. Workshop on Computational Geometry 1991: 289-308 - Sabine Stifter:
Predictions About Collision Free Paths from Intersection Tests. Workshop on Computational Geometry 1991: 309-320 - Hanspeter Bieri, Hartmut Noltemeier:
Computational Geometry - Methods, Algorithms and Applications, International Workshop on Computational Geometry CG'91, Bern, Switzerland, March 21-22, 1991. Lecture Notes in Computer Science 553, Springer 1991, ISBN 3-540-54891-2 [contents]
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-11-12 21:04 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