default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete & Computational Geometry, Volume 16
Volume 16, Number 1, 1996
- Edgar A. Ramos:
The Number of Extreme Triples of a Planar Point Set. 1-19 - T. J. Richardson:
Planar Rectifiable Curves Are Determined by Their. Projections. 21-31 - Emilio Bujalance García, Antonio F. Costa
, José Manuel Gamboa Mutuberría, Javier Lafuente López:
An Algorithm To Compute Orders and Ramification Indices of Cyclic Actions on Compact Surfaces, II. 33-54 - Peter M. Gruber, M. Ludwig:
A Helmholtz-Lie Type Characterization of Ellipsoids, II. 55-67 - Jan Verschelde, Karin Gatermann, Ronald Cools:
Mixed-Volume Computation by Dynamic Lifting Applied to Polynomial System Solving. 69-112 - Lothar Piepmeyer:
The Maximum Number of Odd Integral Distances Between Points in the Plane. 113-115
Volume 16, Number 2, 1996
- Dan Halperin, Micha Sharir:
A Near-Quadratic Algorithm for Planning the Motion of a Polygon in a Polygonal Environment. 121-134 - William Rucklidge:
Lower Bounds for the Complexity of the Graph of the Hausdorff Distance as a Function of Transformation. 135-153 - Sunil Arya, David M. Mount, Onuttom Narayan:
Accounting for Boundary Effects in Nearest-Neighbor Searching. 155-176 - Ngoc-Minh Lê:
On Voronoi Diagrams in the $R^D$. 177-196 - Francisco Santos:
On Delaunay Oriented Matroids for Convex Distance Functions. 197-210
Volume 16, Number 3, 1996
- Jörg Rambau, Günter M. Ziegler:
Projections of Polytopes and the Generalized Baues Conjecture. 215-237 - Alon Efrat, Micha Sharir:
A Near-Linear Algorithm for the Planar Segment-Center Problem. 239-257 - Gábor Hetyei:
On the cd-Variation Polynomials of André and Simsun Permutations. 259-275 - G. MacDonald, Thomas C. Shermer:
Isomorphism of Spiral Polygons. 277-304 - Wojciech Banaszczyk:
Inequalities for Convex Bodies and Polar Reciprocal Lattices in $R^n$ II: Application of $K$-Convexity. 305-311
Volume 16, Number 4, 1996
- Emo Welzl:
Guest Editor's Foreword. 315 - Pankaj K. Agarwal, Micha Sharir:
Efficient Randomized Algorithms for Some Geometric. Optimization Problems. 317-337 - Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu:
Triangulations Intersect Nicely. 339-359 - Timothy M. Chan:
Optimal Output-Sensitive Convex Hull Algorithms in Two and Three Dimensions. 361-368 - Timothy M. Chan:
Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems. 369-387 - Jeff Erickson:
New Lower Bounds for Hopcroft's Problem. 389-418 - Michel Pocchiola, Gert Vegter:
Topologically Sweeping Visibility Complexes via Pseudotriangulations. 419-453 - Boaz Tagansky:
A New Technique for Analyzing Substructures in Arrangements of Piecewise Linear Surfaces. 455-479
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-12-04 22:10 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:
