![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
14. CCCG 2002: Lethbridge, Alberta, Canada
- Proceedings of the 14th Canadian Conference on Computational Geometry, University of Lethbridge, Alberta, Canada, August 12-14, 2002. 2002
- Erik D. Demaine, John Iacono, Stefan Langerman:
Proximate point searching. 1-4 - Valentina Damerow, Lukas Finschi, Martin Ziegler:
Point location algorithms of minimum size. 5-9 - Asish Mukhopadhyay:
Using simplicial partitions to determine a closest point to a query line. 10-12 - Stephane Durocher, David G. Kirkpatrick:
On the hardness of turn-angle-restricted rectilinear cycle cover problems. 13-16 - Prosenjit Bose, Joachim Gudmundsson, Pat Morin:
Ordered theta graphs. 17-21 - Jens-Michael Wierum:
Logarithmic path-length in space-filling curves. 22-26 - Greg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
On flat-state connectivity of chains with fixed acute angles. 27-30 - Erik D. Demaine, Robert A. Hearn, Michael Hoffmann:
Push-2-f is pspace-complete. 31-35 - Benjamin M. Marlin, Godfried T. Toussaint:
Constructing convex 3-polytopes from two triangulations of a polygon. 36-39 - Imma Boada, Narcís Coll, Joan Antoni Sellarès:
Hierarchical planar voronoi diagram approximations. 40-44 - Joachim Giesen, Matthias John:
The complexity of flow diagrams in the plane. 45-48 - Meenakshisundaram Gopi:
On sampling and reconstructing surfaces with boundaries. 49-53 - Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel:
Efficient answering of polyhedral queries in rd using bbs-trees. 54-57 - Mario Alberto López, Bradford G. Nickerson:
Analysis of half-space range search using the k-d search skip list. 58-62 - Michael Hoffmann, Csaba D. Tóth:
Connecting points in the presence of obstacles in the plane. 63-67 - Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint:
Computing signed permutations of polygons. 68-71 - Francois Anton, David G. Kirkpatrick, Darka Mioc:
An exact algebraic predicate for maintaining the topology of the voronoi diagram for circles. 72-76 - Robust algorithm for k-gon voronoi diagram construction. 77-81
- Marina L. Gavrilova:
A reliable algorithm for computing the generalized voronoi diagram for a set of spheres in the euclidean d-dimensional space. 82-87 - Leonard Hagger, Ian D. Sanders:
Partitioning a deformed urban grid. 88-92 - Mirela Damian-Iordache:
Exact and approximation algorithms for computing a-fat decompositions. 93-96 - Joseph O'Rourke, Geetika Tewari:
Partitioning orthogonal polygons into fat rectangles in polynomial time. 97-100 - Melody Donoso, Joseph O'Rourke:
Nonorthogonal polyhedra built from rectangles. 101-104 - Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang:
Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. 105-108 - Hervé Brönnimann, Marc Glisse, David R. Wood:
Cost-optimal quadtrees for ray shooting. 109-112 - Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
On the number of lines tangent to four convex polyhedra. 113-117 - Sergei Bespamyatnikh:
Computing closest points for segments. 118-122 - João Dinis, Margarida Mamede:
A sweep line algorithm for nearest neighbour queries. 123-127 - Anil Maheshwari, Jan Vahrenhold, Norbert Zeh:
On reverse nearest neighbor queries. 128-132 - Po-Hsueh Huang, Yin-Te Tsai, Chuan Yi Tang:
A near-quadratic algorithm for the alpha-connected two-center decision problem. 133-136 - Therese Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar:
Searching for the center of a circle. 137-141 - Prosenjit Bose, Michiel H. M. Smid, David R. Wood:
Light edges in degree-constrained graphs. 142-145 - Therese Biedl, Timothy M. Chan, Alejandro López-Ortiz:
Drawing k2, n: A lower bound. 146-148 - Emilio Di Giacomo, Giuseppe Liotta, Stephen K. Wismath:
Drawing series-parallel graphs on a box. 149-153 - Masud Hasan, Md. Saidur Rahman, Takao Nishizeki:
A linear algorithm for compact box-drawings of trees. 154-157 - Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann:
Convexity minimizes pseudo-triangulations. 158-161 - Sergei Bespamyatnikh:
Enumerating pseudo-triangulations in the plane. 162-166 - David Orden, Francisco Santos:
Asymptotically efficient triangulations of the d-cube. 167-169 - Frederick Crimins, Diane L. Souvaine:
Constructing differentiable homeomorphisms between isomorphic triangulations. 170-173 - Erik D. Demaine, Joseph O'Rourke:
Open problems from cccg 2001. - Stan Wagon:
A machine resolution of a four-color hoax. 174-185 - Ulrich Kortenkamp:
Cinderella: Computation, complexity, geometry. 186-191 - Luc Devroye:
Paul Erdös memorial lecture.
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.