17. CCCG 2005: University of Windsor, Ontario, Canada

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

Last update Tue May 22 23:23:23 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page