default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7. CCCG 1995: Quebec, Canada
- Proceedings of the 7th Canadian Conference on Computational Geometry, Quebec City, Quebec, Canada, August 1995. Carleton University, Ottawa, Canada 1995
- Frank Follert, Elmar Schömer, Jürgen Sellen:
Subquadratic algorithms for the weighted maximin facility location problem. 1-6 - Frank Follert:
Maxmin location of an anchored ray in 3-space and related problems. 7-12 - Kasturi R. Varadarajan, Pankaj K. Agarwal:
Linear approximation of simple objects. 13-18 - Jerzy W. Jaromczyk, Miroslaw Kowaluk:
A geometric proof of the combinatorial bounds the number of optimal solutions for the 2-center euclidean problem. 19-24 - Nimish R. Shah:
Homeomorphic meshes in Rd. 25-30 - Tamal K. Dey, Nimish R. Shah:
On the number of simplicial complexes in Rd. 31-36 - Tetsuo Asano, Naoki Katoh, Elena Lodi, Thomas Roos:
Optimal approximation of monotone curves on a grid. 37-42 - Jian Huang, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
A note on approximations of rectilinear polygons. 43-48 - Pascal Desnoguès, Olivier Devillers:
A locally optimal triangulation of the hyperbolic paraboloid. 49-54 - Victor J. Milenkovic:
Practical methods for set operations on polygons using exact arithmetic. 55-60 - Gill Barequet, Matthew Dickerson, Petru Pau:
Translating a convex polygon to contain maximum number of points. 61-66 - Helmut Alt, David Hsu, Jack Snoeyink:
Computing the largest inscribed isothetic rectangle. 67-72 - Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Godfried T. Toussaint:
Aperture angle optimization problems. 73-78 - Victor Milenkovic:
Position based physics animating and packing spheres inside polyhedra. 79-84 - Jeff Erickson:
On the relative complexities of some geometric problems. 85-90 - Sariel Har-Peled, Timothy M. Chan, Boris Aronov, Dan Halperin, Jack Snoeyink:
The complexity of a single face of a minkowski sum. 91-96 - Alfredo García Olaverri, Marc Noy, Javier Tejel:
Lower bounds for the number noncrossing free subgraphs of Kn. 97-102 - Gautam Das, Giri Narasimhan:
Short cuts in higher dimensional space. 103-108 - William Evans:
Regular polygons are most tolerant. 109-113 - Sung Kwon Kim:
Simple algorithms for orthogonal upward drawings of binary and ternary trees. 115-120 - Paul Colley, Henk Meijer, David Rappaport:
Motivating lazy guards. 121-126 - Laxmi P. Gewali, Simeon C. Ntafos:
Watchman routes in the presence of a pair of convex polygons. 127-132 - Danny Z. Chen, Vladimir Estivill-Castro, Jorge Urrutia:
Optimal guarding of polygons and monotone chains. 133-138 - Siu-Ming Yiu:
A generalized fortress problem using k-consecutive vertex guards. 139-144 - Patrice Belleville:
Convex covers in higher dimensions. 145-150 - Joseph O'Rourke, Thomas C. Shermer, Ileana Streinu:
Illuminating convex polygonswith vertex floodlight. 151-156 - Leizhen Cai, Hazel Everett:
Visibility graphs of polygonal rings. 157-161 - Kathleen Romanik:
Directed rectangle visibility graphs have unbounded dimension. 163-167 - Danny Z. Chen, Kevin S. Klenk:
Rectilinear short path queries among rectangular obstacles. 169-174 - Christian Chenier, Jorge Urrutia:
Shortest paths in convex and simple weighted polygons. 175-179
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-11-28 23:54 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:
