16. CCCG 2004:
Montreal,
Québec,
Canada
Proceedings of the 16th Canadian Conference on Computational Geometry,
CCCG'04,
Concordia University,
Montreal,
Québec,
Canada,
August 9-11,
2004
- Adrian Dumitrescu:
A remark on the Erdös-Szekeres theorem.
2-3
- Khaled M. Elbassioni, Amr Elmasry, Vladimir Gurvich:
A stronger version of Bárány's theorem in the plane.
4-6
- Gruia Calinescu, Adrian Dumitrescu, Peng-Jun Wan:
Separating points by axis-parallel lines.
7-10
- Joachim Giesen, Simon Spalinger:
Meshless surface reconstruction by kernel clustering.
11-14
- Daniel Freedman:
Surface reconstruction, one triangle at a time.
15-19
- Mirela Damian, Joseph O'Rourke:
On corners of objects built from parallelepiped bricks.
20-23
- Benoît Hudson, Gary L. Miller:
Using bistellar flips for rotations in point location structures.
29-32
- Stephan Foldes:
Decomposition of planar motions into reflections and rotations with distance constraints.
33-35
- Valentin Polishchuk:
The box mover problem.
36-39
- Pat Morin, David R. Wood:
Three-dimensional 1-bend graph drawings.
40-43
- Andrea Mantler, Jack Snoeyink:
Banana spiders: A study of connectivity in 3d combinatorial rigidity.
44-47
- Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth:
Encompassing colored crossing-free geometric graphs.
48-52
- Therese C. Biedl, Burkay Genç:
When can a graph form an orthogonal polyhedron?
53-56
- Henk Meijer, David Rappaport:
Simultaneous edge flips for convex subdivisions.
57-59
- Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
Unfolding polyhedral bands.
60-63
- Erik D. Demaine, Satyan L. Devadoss, Joseph S. B. Mitchell, Joseph O'Rourke:
Continuous foldability of polygonal paper.
64-67
- Chris Gray, William Evans:
Optimistic shortest paths on uncertain terrains.
68-71
- Jose Antonio Pérez Ruy-Díaz, Mohammed Safar Sideq:
Approximating optimal paths in terrains with weight defined by a piecewise-linear function.
72-75
- William S. Evans, Daniel Archambault, David G. Kirkpatrick:
Computing the set of all distant horizons of a terrain.
76-79
- Vamsikrishna Kundeti, Prosenjit Gupta:
Efficient polygon enclosure algorithms for device extraction from VLSI layouts.
82-85
- Chris Worman, Mark D. Watson:
Tiling layouts with dominoes.
86-90
- Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid, Eric Johnson, Paul Castillo, Jörg Schwerdt:
Approximating contact-area of supports in layered manufacturing.
91-94
- Steven E. Pav:
An anisotropic cardinality bound for triangulations.
95-98
- Michael Burr, Alan Cheng, Ryan Coleman, Diane L. Souvaine:
Transformations and algorithms for least sum of squares hypersphere fitting.
104-107
- Prosenjit Bose, Marc J. van Kreveld:
Computing nice sweeps for polyhedra and polygons.
108-111
- Robin Y. Flatland:
On sequential triangulations of simple polygons.
112-115
- Sandip Das, Partha P. Goswami, Subhas C. Nandy:
Smallest k point enclosing rectangle of arbitrary orientation.
116-119
- Prosenjit Bose, Carlos Seara, Saurabh Sethia:
On computing enclosing isosceles triangles and related problems.
120-123
- Frank Nielsen, Richard Nock:
Approximating smallest enclosing disks.
124-127
- Gill Barequet, Vadim Rogol:
Maximizing the area of an axis-symmetric polygon inscribed by a convex polygon.
128-131
- Harish Gopala, Pat Morin:
Algorithms for bivariate zonoid depth.
132-135
- Michael Burr, Eynat Rafalin, Diane L. Souvaine:
Simplicial depth: An improved definition, analysis, and efficiency for the finite sample case.
136-139
- Stephane Durocher, David G. Kirkpatrick:
The gaussian centre and the projection centre of a set of points in r3.
140-144
- Jean Cardinal, Sébastien Collette, Stefan Langerman:
Local properties of geometric graphs.
145-148
- Bradford G. Nickerson, Qingxiu Shi:
Tries for combined text and spatial data range search.
149-153
- Ding Liu, Bernard Chazelle, Avner Magen:
Approximate range searching in higher dimension.
154-157
- Sean M. Falconer, Bradford G. Nickerson:
On multi-level k-ranges for range search.
158-161
- Adrian Dumitrescu, Günter Rote:
On the Fréchet distance of a set of curves.
162-165
- Francois Anton, Sergey Bereg:
The fitting line problem in the laguerre geometry.
166-169
- David Bremner, David Gay:
Experimental lower bounds for three simplex chirality measures in low dimension.
170-173
- Deok-Soo Kim, Youngsong Cho, Donguk Kim:
Edge-tracing algorithm for euclidean voronoi diagram of 3d spheres.
176-179
- Thomas F. Hain, Athar L. Ahmad, David D. Langan:
Precise flattening of cubic Bézier segments.
180-183
- Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile:
On the number of line tangents to four triangles in three-dimensional space.
184-187
- Nathanael Berglund, Andrzej Szymczak:
Making contour trees subdomain-aware.
188-191
- Raja Jothi, Balaji Raghavachari:
Degree-bounded minimum spanning trees.
192-195
- Susumu Suzuki, Toshihide Ibaraki:
An average running time analysis of a backtracking algorithm to calculate the measure of the union of hyperrectangles in $d$ dimensions.
196-199
- Adrian Dumitrescu:
On some monotone path problems in line arrangements.
200-203
- Farshad Rostamabadi, Mohammad Ghodsi:
A fast algorithm for updating a labeling to avoid a moving point.
204-208
Last update Wed Feb 15 04:55:57 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
