default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Computational Geometry and Applications, Volume 2
Volume 2, Number 1, 1992
- Michael B. Dillencourt, David M. Mount, Nathan S. Netanyahu:
A randomized algorithm for slope selection. 1-27 - Kokichi Sugihara:
Voronoi diagrams in a river. 29-48 - Jeffrey S. Salowe:
Enumerating interdistances in space. 49-59 - Chung-Do Yang, D. T. Lee, C. K. Wong:
On bends and lengths of rectilinear paths: a graph theoretic approach. 61-74 - Tamal K. Dey, Chandrajit L. Bajaj, Kokichi Sugihara:
On good triangulations in three dimensions. 75-95 - Olivier Devillers
:
Randomization yields simple O(n log* n) algorithms for difficult Omega(n) problems. 97-111
Volume 2, Number 2, 1992
- Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan:
Randomized parallel algorithms for trapezoidal diagrams. 117-133 - Fang-Rong Hsu, R. C. Chang, Richard C. T. Lee:
Parallel algorithms for computing the closest visible vertex pair between two polygons. 135-162 - Nancy M. Amato, Franco P. Preparata:
The parallel 3D convex hull problem revisited. 163-173 - Sumanta Guha:
Parallel computation of internal and external farthest neighbours in simple polygons. 175-190 - Sharat Chandran, David M. Mount:
A parallel algorithm for enclosed and enclosing triangles. 191-214 - Joseph O'Rourke:
Computational geometry column 15. 215-217
Volume 2, Number 3, 1992
- Matthew Dickerson, Robert L. (Scot) Drysdale III, Jörg-Rüdiger Sack:
Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors. 221-239 - Marshall W. Bern, David Eppstein:
Polynomial-size nonobtuse triangulation of polygons. 241-255 - Christian Icking, Rolf Klein:
The Two Guards Problem. 257-285 - Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars:
Shortest path queries in rectilinear worlds. 287-309 - Yi-Jen Chiang, Roberto Tamassia:
Dynamization of the trapezoid method for planar point location in monotone subdivisions. 311-333 - Joseph O'Rourke:
Computational geometry column 16. 335-339 - Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan:
Erratum: Randomized parallel algorithms for trapezoidal diagrams. 341-343
Volume 2, Number 4, 1992
- Collette R. Coullard, Anna Lubiw:
Distance visibility graphs. 349-362 - Franz Aurenhammer, Otfried Schwarzkopf:
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams. 363-381 - Gordon T. Wilfong:
Nearest neighbor problems. 383-416 - Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Godfried T. Toussaint, Ivan Stojmenovic, Jorge Urrutia:
Computing shortest transversals of sets. 417-442 - Joseph O'Rourke:
Computational geometry column 17. 443-447 - Marshall W. Bern, David Eppstein:
Erratum: Polynomial-size nonobtuse triangulation of polygons. 449-450
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.
last updated on 2025-01-23 20:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
