17. CCCG 2005:
University of Windsor,
Ontario,
Canada
Proceedings of the 17th Canadian Conference on Computational Geometry,
CCCG'05,
University of Windsor,
Ontario,
Canada,
August 10-12,
2005
- Kumar Gaurav Bijay, Antoine Vigneron:
A practical approach to approximating diameter of point-set in low dimensions.
3-6
Electronic Edition (link) BibTeX
- Bradford G. Nickerson, Qingxiu Shi:
Approximate Orthogonal Range Search using Patricia Tries.
7-10
Electronic Edition (link) BibTeX
- Daya Ram Gaur, Ramesh Krishnamurti:
Faster approximation algorithms for scheduling tasks with a choice of start times.
11-14
Electronic Edition (link) BibTeX
- Timothy M. Chan, Abdullah-Al Mahmood:
Approximating the piercing number for unit-height rectangles.
15-18
Electronic Edition (link) BibTeX
- Peyman Afshani, Timothy M. Chan:
Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs.
19-22
Electronic Edition (link) BibTeX
- Lilian Buzer:
The min-# problem, a hybrid error criterion for near linear time performance.
23-26
Electronic Edition (link) BibTeX
- Eric Y. Chen, Timothy M. Chan:
Space-Efficient Algorithms for Klee's Measure Problem.
27-30
Electronic Edition (link) BibTeX
- Gill Barequet, Jonathan Naor:
Large k-D Simplices in the d-Dimensional Cube.
31-34
Electronic Edition (link) BibTeX
- Craig Falls, Yuanxin Liu, Jack Snoeyink, Diane L. Souvaine:
Testing Shortcuts to Maintain Simplicity in Subdivision Simplification.
35-38
Electronic Edition (link) BibTeX
- Andreas Spillner:
Optimal convex partitions of point sets with few inner points.
39-42
Electronic Edition (link) BibTeX
- Pankaj K. Agarwal, Mark de Berg, Jie Gao, Leonidas J. Guibas, Sariel Har-Peled:
Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points.
43-46
Electronic Edition (link) BibTeX
- Stephane Durocher, David G. Kirkpatrick:
The Projection Median of a Set of Points in R2.
47-51
Electronic Edition (link) BibTeX
- Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara:
Small weak epsilon nets.
52-56
Electronic Edition (link) BibTeX
- Jonathan Lenchner, Hervé Brönnimann:
Observations and Computations in Sylvester-Gallai Theory.
57-60
Electronic Edition (link) BibTeX
- Timothy G. Abbott, Erik D. Demaine, Martin L. Demaine, Daniel Kane, Stefan Langerman, Jelani Nelson, Vincent Yeung:
Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane.
61-64
Electronic Edition (link) BibTeX
- Paz Carmi, Matthew J. Katz:
Minimum-Cost Load-Balancing Partitions.
65-67
Electronic Edition (link) BibTeX
- Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura:
Reverse facility location problems.
68-71
Electronic Edition (link) BibTeX
- Iris Ashkenazi, Boaz Ben-Moshe, Jihad El-Sana:
Approximating Radio Maps.
72-75
Electronic Edition (link) BibTeX
- Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember:
Collection depot location problem in the plane.
76-79
Electronic Edition (link) BibTeX
- Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi:
Computing the Widest Empty Boomerang.
80-83
Electronic Edition (link) BibTeX
- Sándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann:
A New Approach for Boundary Recognition in Geometric Sensor Networks.
84-87
Electronic Edition (link) BibTeX
- George Kao, Thomas Fevens, Jaroslav Opatrny:
Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks.
88-91
Electronic Edition (link) BibTeX
- Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop:
Pricing of Geometric Transportation Networks.
92-96
Electronic Edition (link) BibTeX
- Robert L. Scot Drysdale, Clifford Stein, David P. Wagner:
An O(n5/2log n) Algorithm for the Rectilinear Minimum Link-Distance Problem.
97-100
Electronic Edition (link) BibTeX
- Valentin Polishchuk, Joseph S. B. Mitchell:
k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane.
101-104
Electronic Edition (link) BibTeX
- Therese C. Biedl, Franz-Josef Brandenburg:
Drawing planar bipartite graphs with small area.
105-108
Electronic Edition (link) BibTeX
- Therese C. Biedl, Anna Lubiw, Michael J. Spriggs:
Morphing Polyhedra Preserving Face Normals: A Counterexample.
109-112
Electronic Edition (link) BibTeX
- Carla Binucci, Walter Didimo:
Experiments on Area Compaction Algorithms for Orthogonal Drawings.
113-116
Electronic Edition (link) BibTeX
- Therese C. Biedl, Burkay Genc:
Complexity of Octagonal and Rectangular Cartograms.
117-120
Electronic Edition (link) BibTeX
- Stirling Chow, Frank Ruskey:
Area-Proportional Drawings of Intersecting Families of Simple Closed Curves.
121-124
Electronic Edition (link) BibTeX
- Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber:
Matching Edges and Faces in Polygonal Partitions.
126-129
Electronic Edition (link) BibTeX
- André Schulz:
New results on Pseudo-triangulations with low vertex degree.
130-133
Electronic Edition (link) BibTeX
- Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer:
Dynamic updates of succinct triangulations.
134-137
Electronic Edition (link) BibTeX
- Csaba D. Tóth, Diane L. Souvaine:
A vertex-face assignment for plane graphs.
138-141
Electronic Edition (link) BibTeX
- Raquel Viaña:
Compactly Encoding and Decoding the Connectivity of a Plane Graph in Linear Time.
142-145
Electronic Edition (link) BibTeX
- N. Madhusudhanan, Prosenjit Gupta, Abhijit Mitra:
Efficient Algorithms for Range Queries in Protein Sequence Analysis.
146-149
Electronic Edition (link) BibTeX
- Rabiul Islam, Nahid Afroz, Subir Bandyopadhyay, Bhabani P. Sinha:
Computational Geometry on Optical Multi-Trees (OMULT) Computer System.
150-154
Electronic Edition (link) BibTeX
- Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy:
A Fast Algorithm for Point Labeling Problem.
155-158
Electronic Edition (link) BibTeX
- Sherif Ghali, Chris Smith:
Computing the Boundary of a Class of Labeled-Leaf BSP Solids.
159-162
Electronic Edition (link) BibTeX
- Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood:
The Distance Geometry of Deep Rhythms and Scales.
163-166
Electronic Edition (link) BibTeX
- Subhashis Majumder, Bhargab B. Bhattacharya:
Density or Discrepancy: A VLSI Designer's Dilemma in Hot Spot Analysis.
167-170
Electronic Edition (link) BibTeX
- Stefan Schirra:
Feasibility of the Exact Geometric Computation Paradigm for Largest Empty Anchored Cylinder Computation in the Plane.
171-174
Electronic Edition (link) BibTeX
- Gill Barequet, Yuval Scharf:
The Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex Polygon.
175-178
Electronic Edition (link) BibTeX
- Prosenjit Bose, Jason Morrison:
Translating a Star over a Point Set.
179-182
Electronic Edition (link) BibTeX
- Ramaswamy Chandrasekaran, Ovidiu Daescu, Jun Luo:
Cutting Out Polygons.
183-186
Electronic Edition (link) BibTeX
- Therese C. Biedl:
The complexity of domino tiling.
187-190
Electronic Edition (link) BibTeX
- Theocharis Malamatos:
Lower bounds for expected-case planar point location.
191-194
Electronic Edition (link) BibTeX
- Maike Buchin, Joachim Giesen:
Minimizing the Total Absolute Gaussian Curvature in a Terrain is Hard.
195-198
Electronic Edition (link) BibTeX
- Therese C. Biedl, Joseph Douglas Horton, Alejandro López-Ortiz:
Cross-Stitching Using Little Thread.
199-202
Electronic Edition (link) BibTeX
- Chris Worman, Boting Yang:
On the Computation and Chromatic Number of Colored Domino Tilings.
203-206
Electronic Edition (link) BibTeX
- James Factor:
Designing Modern Linkages to Trace Bezier Curves.
207-210
Electronic Edition (link) BibTeX
- Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Unfolding Manhattan Towers.
211-214
Electronic Edition (link) BibTeX
- Dominique Michelucci, Sebti Foufou, Loïc Lamarque, David Ménegaux:
Bernstein based arithmetic featuring de Casteljau.
215-218
Electronic Edition (link) BibTeX
- Audrey Lee, Ileana Streinu, Louis Theran:
Finding and Maintaining Rigid Components.
219-222
Electronic Edition (link) BibTeX
- Jack Snoeyink, Ileana Streinu:
Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time.
223-226
Electronic Edition (link) BibTeX
- Ovidiu Daescu, Jun Luo, David M. Mount:
Proximity Problems on Line Segments Spanned by Points.
227-231
Electronic Edition (link) BibTeX
- Kathryn Duffy, Chris McAloney, Henk Meijer, David Rappaport:
Closest Segments.
232-234
Electronic Edition (link) BibTeX
- John Fischer, Sariel Har-Peled:
Dynamic Well-Separated Pair Decomposition Made Easy.
235-238
Electronic Edition (link) BibTeX
- Wm. Randolph Franklin:
Nearest Point Query on 184M Points in E3 with a Uniform Grid.
239-242
Electronic Edition (link) BibTeX
- Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi:
Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles.
243-246
Electronic Edition (link) BibTeX
- Amr Elmasry, Khaled M. Elbassioni:
Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane.
248-251
Electronic Edition (link) BibTeX
- Nejib Zaguia, Guy-Vincent Jourdan, Mustafa Alhashem:
On the Pagenumber of Bipartite Orders.
252-255
Electronic Edition (link) BibTeX
- Christophe Weibel, Komei Fukuda:
Computing faces up to k dimensions of a Minkowski Sum of Polytopes.
256-259
Electronic Edition (link) BibTeX
- Michael Burr, Alexandra Lauric, Katelyn Mann:
Searching for the Center of an Ellipse.
260-263
Electronic Edition (link) BibTeX
- Jack Snoeyink:
Maximum Independent Set for Intervals by Divide-Prune-and-Conquer.
264-265
Electronic Edition (link) BibTeX
- Jean-Daniel Boissonnat, Camille Wormser, Mariette Yvinec:
Anisotropic Diagrams: Labelle Shewchuk approach revisited.
266-269
Electronic Edition (link) BibTeX
- Kevin Buchin, Joachim Giesen:
Flow Complex: General Structure and Algorithm.
270-273
Electronic Edition (link) BibTeX
- Shin-ichi Tanigawa, Naoki Katoh:
Finding a triangular mesh with a constant number of different edge lengths.
274-277
Electronic Edition (link) BibTeX
- Jean Cardinal, Sébastien Collette, Stefan Langerman:
Region Counting Distances and Region Counting Circles.
278-281
Electronic Edition (link) BibTeX
- Démian Nave, Nikos Chrisochoides:
Boundary Refinement in Delaunay Mesh Generation Using Arbitrarily Ordered Vertex Insertion.
282-285
Electronic Edition (link) BibTeX
- Lilian Buzer:
Solving online feasibility problem in constant amortized time per update.
286-289
Electronic Edition (link) BibTeX
- Valentin Polishchuk, Joseph S. B. Mitchell:
Touring Convex Bodies - A Conic Programming Solution.
290-293
Electronic Edition (link) BibTeX
- Luc Habert:
Computing bitangents for ellipses.
294-297
Electronic Edition (link) BibTeX
- Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang:
An Experimental Assessment of the 2D Visibility Complex.
298-301
Electronic Edition (link) BibTeX
- Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath:
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint.
302-305
Electronic Edition (link) BibTeX
Copyright © Fri Oct 3 22:13:24 2008
by Michael Ley (ley@uni-trier.de)
