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