|
|
Conferences in DBLP
- Boting Yang, Cao An Wang
Minimal Tetrahedralizations of a Class of Polyhedra. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Christophe Lemaire, Jean-Christophe Weill
Partitioning the sphere with constant area quadrangles. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Stefan Langerman
On the Shooter Location Problem. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- David G. Kirkpatrick
Guarding Alcove-Free Galleries . [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Naoki Kato
Applications of Computational Geometry in Architecture. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Biliana Kaneva, Joseph O'Rourke
An Implementation of Chen & Han's Shortest Paths Algorithm. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Gil Kalai
Fractional Helly theorem, weak epsilon nets and geometric piercing. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Martin Isenburg, Jack Snoeyink
Spirale Reversi: Reverse Decoding of the Edgebreaker Encoding. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Mary Inaba, Hiroshi Imai
Finding k-Closest-Pairs Efficiently for High Dimensional Data. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Mario A. Lopez, Swanwa Liao
Finding k-Closest-Pairs Efficiently for High Dimensional Data. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Dominique Michelucci, Jean-Michel Moreau
ZEA - A zero-free exact arithmetic . [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Sonoko Moriyama, Fumihiko Takeuchi
Incremental construction properties in dimension two-- shellability, extendable shellability and vertex decomposability. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Colin Ware
Mapping Data to Dimensions of Perceptual Space. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Shin-ichi Tokunaga
On a straight-line embedding problem of forests. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Andrzej Szymczak, Davis King, Jarek Rossignac
An Edgebreaker-Based Efficient Compression Scheme for Connectivity of Regular Meshes. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Christian Sohler, Martin Ziegler
Computing Cut Numbers. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- S. V. Rao, Asish Mukhopadhyay
Efficient Algorithms for Computing the beta-spectrum. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Guilherme Albuquerque Pinto, Pedro Jussieu de Rezende
Additively Weighted Voronoi Diagram on the Oriented Projective Plane. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Bradford G. Nickerson, Yunlan Pan
On Dynamic k-d Half-Space Range Reporting. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Manuela Neagu
Equivalence of Arrangements of Curves. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- John Iacono, Stefan Langerman
Dynamic point location in fat hyperrectangles with integer coordinates. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Michael Hoffmann
Push-* is NP-hard. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Martin Held
Computing Voronoi Diagrams of Line Segments Reliably and Efficiently. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Ralph P. Boland, Jorge Urrutia
Polygon Area Problems. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Ralph P. Boland, Jorge Urrutia
Circular Ray Shooting: Slower but Surer. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Jean-Daniel Boissonnat, Antoine Vigneron
An Elementary Algorithm for Reporting Intersections of Red/Blue Curve Segments. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Peter Anderson, Alejandro López-Ortiz
A New Lower Bound for Kernel Searching. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Nina Amenta, Ravi Krishna Kolluri
The Medial Axis of a Union of Balls. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Therese C. Biedl
1-bend 3-D orthogonal drawings: two open problems solved. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Gill Barequet, Matthew Dickerson
The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
Reconfiguring Convex Polygons. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Hannah Bast, Susan Hert
The Area Partitioning Problem. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Erik D. Demaine, Martin L. Demaine, Craig S. Kaplan
Polygons Cuttable by a Circular Saw. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke
PushPush and Push-1 are NP-hard in 2D. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Mordecai J. Golin, Hyeon-Suk Na
On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Komei Fukuda, Thomas M. Liebling, Christine Lütolf
Extended Convex Hull. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Vladimir Filkov
Covering Points on a Circle with Circular Arcs. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia
Guarding the Convex Subsets of a Point-set. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl
Enumerating Triangulation Paths. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Siu-Wing Cheng, Sheung-Hung Poon
Selecting Independent Chains on a Triangulated 2-Manifold. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Erik D. Demaine, Joseph O'Rourke
Session O1: Open Problems and Planning. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- José Cáceres, Clara I. Grima, Alberto Márquez
Spanners in l1. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
- Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin
Flipping your Lid. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
|
