Conferences in DBLP
Erik D. Demaine , Martin L. Demaine , Anna Lubiw The cccg 2001 logo. [Citation Graph (0, 0)][DBLP ] Conf ] Mike Lazaridis Opportunities for mathematicians in industry government research. [Citation Graph (0, 0)][DBLP ] Conf ] N. J. A. Sloane Plane packing. [Citation Graph (0, 0)][DBLP ] Conf ] George W. Hart Rapid prototyping of geometric models. [Citation Graph (0, 0)][DBLP ] Conf ] Hee-Kap Ahn , Siu-Wing Cheng , Otfried Cheong , Jack Snoeyink The reflex-free hull. [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , Ferran Hurtado , Marc Noy On the number of triangulations every planar point set must have. [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , Hannes Krasser The point set order type data base: A collection of applications and results. [Citation Graph (0, 0)][DBLP ] Conf ] Greg Aloupis , Stefan Langerman , Michael A. Soss , Godfried T. Toussaint Algorithms for bivariate medians and a fermat-torricelli problem for lines. [Citation Graph (0, 0)][DBLP ] Conf ] Diogo Vieira Andrade , Luiz Henrique de Figueiredo Good approximations for the relative neighbourhood graph. [Citation Graph (0, 0)][DBLP ] Conf ] Francois Anton , Darka Mioc , Christopher M. Gold Line voronoi diagram based interpolation and application to digital terrain modelling. [Citation Graph (0, 0)][DBLP ] Conf ] Laurent Balmelli , Thomas M. Liebling , Martin Vetterli Computational analysis of 4-8 meshes with application to surface simplification using global error. [Citation Graph (0, 0)][DBLP ] Conf ] Ralph P. Boland , Jorge Urrutia A simpler circular ray shooting algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Ralph P. Boland , Jorge Urrutia Finding the largest axis aligned rectangle in a polygon in o(n log n) time. [Citation Graph (0, 0)][DBLP ] Conf ] Björn Brodén , Mikael Hammar , Bengt J. Nilsson Guarding lines and 2-link polygons is apx-hard. [Citation Graph (0, 0)][DBLP ] Conf ] Suzanne F. Buchele , Angela C. Roles Binary space partitioning tree and constructive solid geometry representations for objects bounded by curved surfaces. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Y. Cheng , Ming Ouyang On algorithms for simplicial depth. [Citation Graph (0, 0)][DBLP ] Conf ] Éric Colin de Verdière , Michel Pocchiola , Gert Vegter Tutte's barycenter method applied to isotopies. [Citation Graph (0, 0)][DBLP ] Conf ] Karen Daniels , Rajasekhar Inkulu Translational polygon covering using intersection graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Michael Hoffmann Pushing blocks is np-complete for noncrossing solution paths. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Stefan Langerman , Joseph O'Rourke Short interlocked linkages. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Joseph S. B. Mitchell Reaching folded states of a rectangular piece of paper. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Devillers , Philippe Guigue The shuffling buffer. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Devillers , Ferran Hurtado , Mercè Mora , Carlos Seara Separating several point sets in the plane. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey , Joachim Giesen , James Hudson Decimating samples for mesh simplification. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Dickerson , Michael T. Goodrich Matching points to a convex polygonal boundary. [Citation Graph (0, 0)][DBLP ] Conf ] Abbas Edalat , André Lieutier , Elham Kashefi The convex hull in a new model of computation. [Citation Graph (0, 0)][DBLP ] Conf ] Lukas Finschi , Komei Fukuda Complete combinatorial generation of small point configurations and hyperplane arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Gärtner , Thomas Herrmann Computing the width of a point set in 3-space. [Citation Graph (0, 0)][DBLP ] Conf ] David Hart Approximating the shortest path in line arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Hoffmann , Csaba D. Tóth Segment endpoint visibility graphs are hamiltonian. [Citation Graph (0, 0)][DBLP ] Conf ] Jerzy W. Jaromczyk , Yang Wang Local optimization of triangular surface meshes for general quadrics in lp norm. [Citation Graph (0, 0)][DBLP ] Conf ] Lutz Kettner , David G. Kirkpatrick , Bettina Speckmann Tight degree bounds for pseudo-triangulations of points. [Citation Graph (0, 0)][DBLP ] Conf ] Zhangjian Li , Shin-Ichi Nakano Listing all connected plane triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Alejandro López-Ortiz , Graeme Sweet Parallel searching on a lattice. [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Mantler , Jack Snoeyink Heaphull?. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph O'Rourke , Irena Pashchenko , Geetika Tewari Partitioning orthogonal polygons into fat rectangles. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph O'Rourke , Octavia Petrovici Narrowing light rays with mirrors. [Citation Graph (0, 0)][DBLP ] Conf ] Valerio Pascucci On the topology of the level sets of a scalar field. [Citation Graph (0, 0)][DBLP ] Conf ] Axel Pavillet Voronoï diagrams in projective geometry and sweep circle algorithms for constructing circle-based voronoï diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Dana Randall , Günter Rote , Francisco Santos , Jack Snoeyink Counting triangulations and pseudo-triangulations of wheels. [Citation Graph (0, 0)][DBLP ] Conf ] Ian Sanders , Leigh-Ann Kenny Heuristics for placing non-orthogonal axial lines to cross the adjacencies between orthogonal rectangles. [Citation Graph (0, 0)][DBLP ] Conf ] Chang Shu , Michael A. Greenspan , Guy Godin Nearest neighbor search through function minimization. [Citation Graph (0, 0)][DBLP ] Conf ] Jack Snoeyink The arithmetic precision of ray-polygon intersection testing. [Citation Graph (0, 0)][DBLP ] Conf ] Falk Tschirschnitz Testing extendability for partial chirotopes is np-complete. [Citation Graph (0, 0)][DBLP ] Conf ] Alper Üngör Tiling 3d euclidean space with acute tetrahedra. [Citation Graph (0, 0)][DBLP ] Conf ] Chee Yap , Yunyue Zhu Yet another look at fractional cascading: B-graphs with application to point location. [Citation Graph (0, 0)][DBLP ] Conf ] Yunhong Zhou , Subhash Suri Geometric permutations of balls with bounded size disparity. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Ziegler , Vasco Brattka Turing computability of (non-)linear optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Joseph O'Rourke Open problems from cccg 2000. [Citation Graph (0, 0)][DBLP ] Conf ] 