|
Journals in DBLP
- Danièle Beauquier, Maurice Nivat, Eric Rémila, Mike Robson
Tiling Figures of the Plane with Two Bars. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:1-25 [Journal]
- Bernard Chazelle, Jirí Matousek
Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:27-32 [Journal]
- Kathleen Romanik, Steven Salzberg
Testing Orthogonal Shapes. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:33-49 [Journal]
- Hazel Everett, Derek G. Corneil
Negative Results on Characterizing Visibility Graphs. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:51-63 [Journal]
- Peter C. Fishburn
Convex Polygons with Few Intervertex Distances. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:65-93 [Journal]
- Joseph S. B. Mitchell, Subhash Suri
Separation and Approximation of Polyhedral Objects. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:95-114 [Journal]
- Raimund Seidel
The Upper Bound Theorem for Polytopes: an Easy Proof of Its Asymptotic Version. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:115-116 [Journal]
- Marilyn G. Andrews, D. T. Lee
Parallel Algorithms on Circular-arc Graphs. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:117-141 [Journal]
- Ricardo A. Baeza-Yates, René Schott
Parallel Searching in the Plane. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:143-154 [Journal]
- Rex A. Dwyer
The Expected Size of the Sphere-of-influence Graph. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:155-164 [Journal]
- Anka Gajentaan, Mark H. Overmars
On a Class of O(n2) Problems in Computational Geometry. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:165-185 [Journal]
- Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir
Computing Depth Orders for Fat Objects and Related Problems. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:187-206 [Journal]
- Diane L. Souvaine, Chee-Keng Yap
Combinatorial Complexity of Signed Discs. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:207-223 [Journal]
- Kurt Swanson, D. T. Lee, Vanban L. Wu
An Optimal Algorithm for Roundness Determination on Convex Polygons. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:225-235 [Journal]
- Bernard Chazelle, Burton Rosenberg
Simplex Range Reporting on a Pointer Machine. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:237-247 [Journal]
- Mark de Berg
Generalized Hidden Surface Removal. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:249-276 [Journal]
- Matthew Dickerson, David Eppstein
Algorithms for Proximity Problems in Higher Dimensions. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:277-291 [Journal]
- Mikhail J. Atallah, Andreas Fabri
On the Multisearching Problem for Hypercubes. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:293-302 [Journal]
- Jean-Daniel Boissonnat, Katrin Dobrindt
On-line Construction of the Upper Envelope of Triangles and Surface Patches in Three Dimensions. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:303-320 [Journal]
- Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:321-340 [Journal]
|