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