default search action
International Journal of Computational Geometry and Applications, Volume 6
Volume 6, Number 1, 1996
- Jean-Daniel Boissonnat, André Cérézo, Olivier Devillers
, Monique Teillaud:
Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes. 1-14 - Paul J. Heffernan:
An optimal algorithm for the two-guard problem. 15-44 - A. Corbalan, Marisa Mazón, Tomás Recio
Geometry of bisectors for strictly convex distances. 45-58 - W. S. Chan, F. Chin:
Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum error. 59-77 - Reuven Bar-Yehuda, E. Ben-Hanoch:
A linear time algorithm for covering simple polygons with similar rectangles. 79-102 - C. Gitlin, Joseph O'Rourke, V. Subramanian:
On reconstructing polyhedra from parallel slices. 103-122 - Joseph O'Rourke:
Computational geometry column 27. 123-125
Volume 6, Number 2, 1996
- Jindong Chen, Yijie Han:
Shortest paths on a polyhedron. 127-144 - Peter Eades, Xuemin Lin, Roberto Tamassia:
An Algorithm for Drawing a Hierarchical Graph. 145-156 - Robert Joan-Arinyo, Àlvar Vinacua
Classification of a point with respect to a polyhedron vertex. 157-168 - Rex A. Dwyer, William F. Eddy:
Maximal empty ellipsoids. 169-186 - A. Chubarev:
Robust set operations on polyhedral solids: a fixed precision approach. 187-204 - Sven Schuierer:
An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon. 205-226 - Baining Guo:
On the difficulty of deciding the convexity of polynomials over simplexes. 227-230 - Omer Berkman, Baruch Schieber, Uzi Vishkin:
A fast parallel algorithm for finding the convex hull of a sorted point set. 231-242 - Joseph O'Rourke:
Computational geometry column 28. 243-244
Volume 6, Number 3, 1996
- Hazel Everett, Jean-Marc Robert, Marc J. van Kreveld:
An optimal algorithm for the (<= k)-levels, with applications to separation and transversal problems. Int. J. Comput. Geom. Appl. 6(3): 247-261 (1996) - Rolf Klein, Andrzej Lingas:
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. 263-278 - Michel Pocchiola, Gert Vegter:
The visibility complex. 279-308 - Joseph S. B. Mitchell:
Shortest paths among obstacles in the plane. 309-332 - Ashim Garg, Michael T. Goodrich, Roberto Tamassia:
Planar upward tree drawings with optimal area. 333-356 - Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant
Approximating center points with iterative Radon points. 357-377 - Frank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin
Scalable parallel computational geometry for coarse grained multicomputers. 379-400
Volume 6, Number 4, 1996
- Ioannis Fudos, Christoph M. Hoffmann:
Correctness proof of a geometric constraint solver. 405-420 - John C. Owen:
Constraint on simple geometry in two and three dimensions. 421-434 - Pierre J. Malraison:
Constraining a quadratic rational Bezier to be an elliptical arc. 435-441 - Malcolm S. Casale:
Evaluating geometric sensitivities at singular and non-singular points of variational CAD models for design optimization. 443-460 - Ichiro Suzuki, Masafumi Yamashita:
Designing multi-link robot arms in a convex polygon. 461-486 - Olivier Devillers
Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers. 487-506 - Joseph O'Rourke:
Computational geometry column 29. 507-511
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 2024-11-19 20:47 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: