The following papers have been accepted to CCCG 2010, subject to participation by at least one author and submission of a revised camera-ready version. Authors of accepted papers can find instructions regarding submission of camera-ready versions on the paper submission page.
Electronic version of accepted papers are available on the online version of the conference program.
| Leonidas Guibas, Nikola Milosavljevic and Arik Motskin | Connected Dominating Sets on Dynamic Geometric Graphs |
| Prosenjit Bose, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Vera Sacristan and Maria Saumell | Some properties of higher order Delaunay and Gabriel graphs |
| William Steiger and Imre Barany | On the Variance of Random Polygons |
| Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman and Pat Morin | Oja Medians and Centers of Gravity |
| Minghui Jiang, Vincent Pilaud and Pedro Tejada | On a dispersion problem in grid labeling |
| Adrian Dumitrescu | Approximate Euclidean Ramsey theorems |
| Adrian Dumitrescu | The traveling salesman problem for lines and rays in the plane |
| David Millman, Matthew O'Meara, Jack Snoeyink and Vishal Verma | Maximum Geodesic Flow in the Plane With Obstacles |
| Prosenjit Bose, Otfried Cheong and Vida Dujmović | On the perimeter of fat objects |
| Radoslav Fulek | Coloring geometric hypergraph defined by an arrangement of half-planes |
| Prosenjit Bose, Karim Douïeb, Vida Dujmović, John Howat and Pat Morin | Fast Local Searches and Updates in Bounded Universes |
| Maarten Löffler and Martin Nöllenburg | Shooting Bricks with Orthogonal Laser Beams: A First Step towards Internal/External Map Labeling |
| Erik Demaine, Martin Demaine and Ryuhei Uehara | Any Monotone Function Can Be Realized by Interlocked Polygons |
| Luca Castelli Aleardi, Eric Fusy and Thomas Lewiner | Optimal encoding of triangular and quadrangular meshes with fixed topology |
| Paz Carmi and Lilach Chaitman | Stable Roommates and Geometric Spanners |
| Anna Lubiw, Erik Demaine, Martin Demaine, Arlo Shallit and Jonah Shallit | Zipper Unfoldings of Polyhedral Complexes |
| Prosenjit Bose and Jean-Lou De Carufel | Minimum Enclosing Area Triangle with a Fixed Angle |
| Perouz Taslakian and Isabel Hubard | Deflating Polygons to the Limit |
| Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthew Katz, Gila Morgenstern and Yael Stein | Direction Assignment in Wireless Networks |
| Gill Barequet, Nadia Benbernou, David Charlton, Erik Demaine, Martin Demaine, Mashhood Ishaque, Anna Lubiw, Andre Schulz, Diane Souvaine, Godfried Toussaint and Andrew Winslow | Bounded-Degree Polyhedronization of Point Sets |
| Birgit Vogtenhuber, Oswin Aichholzer, Ruy Fabila-Monroy, Thomas Hackl, Alexander Pilz, Pedro Ramos and Marc van Kreveld | Blocking Delaunay Triangulations |
| Giovanni Viglietta and Maurizio Monge | The 3-dimensional Searchlight Scheduling Problem |
| William Steiger, Mario Szegedy and Jihui Zhao | Six-Way Equipartitioning by Three Lines in the Plane |
| Kyle Klein and Subhash Suri | Robot Kabaddi |
| Eva Kopecka, Daniel Reem and Simeon Reich | Existence of zone diagrams in compact subsets of uniformly convex spaces |
| Gautam Das and Bradford Nickerson | I/O-efficient triangular range search and its application |
| Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman and Jawaherul Alam | Minimum-Area Drawings of Plane 3-Trees |
| Md. Shafiul Alam and Asish Mukhopadhyay | A new algorithm and improved lower bound for point placement on a line in 2 rounds |
| Adrian Dumitrescu and Minghui Jiang | Constrained k-center and movement to independence |
| Adrian Dumitrescu and Csaba Toth | Watchman tours for polygons with holes |
| Yonit Bousany, Mary Leah Karker, Joseph O'Rourke and Leona Sparaco | Sweeping Minimum Perimeter Enclosing Parallelograms: Optimal Crumb Cleanup |
| David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmović, Pat Morin and Ryuhei Uehara | Ghost Chimneys |
| Bhaswar B. Bhattacharya and Subhas Nandy | New Variations of the Reverse Facility Location Problem |
| Radoslav Fulek, Balázs Keszegh, Filip Moric and Igor Uljarevic | On Polygons Excluding Point Sets |
| Birgit Vogtenhuber, Thomas Hackl and Oswin Aichholzer | Compatible Pointed Pseudo-Triangulations |
| Marek Sulovsky and Uli Wagner | k-Sets and Continuous Motion in R3 |
| Pradeesha Ashok, Sathish Govindarajan and Janardhan Kulkarni | Small Strong Epsilon Nets |
| Farnaz Sheikhi, Mark de Berg, Ali Mohades and Mansoor Davoodi Monfared | Finding Monochromatic L-Shapes in Bichromatic Point Sets |
| Yakov Nekrich and Michiel Smid | Approximating Range-Aggregate Queries using Coresets |
| Riddhipratim Basu, Bhaswar Bhattacharya and Tanmoy Talukdar | The Projection Median of a Set of Points in R^d |
| Craig Dillabaugh | I/O Efficient Path Traversal in Well-Shaped Tetrahedral Meshes |
| Braxton Carrigan | Evading Equilateral Trinagle Translates without a Map |
| Ana Paula Malheiro and Jorge Stolfi | Finding Minimal Bases in Arbitrary Spline Spaces |
| Stefan Huber and Martin Held | Computing Straight Skeletons of Planar Straight-Line Graphs Based on Motorcycle Graphs |
| Kimikazu Kato | On Degeneracy of a Lower Envelope of Algebraic Surfaces |
| Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy, Sangameswar Patil and S. V. Rao | Computing the Straight Skeleton of a Monotone Polygon in O(n log n) Time |
| Fajie Li and Reinhard Klette | Watchman Route in a Simple Polygon with a Rubberband Algorithm |
| Saladi Rahul, Haritha Bellam, Prosenjit Gupta and Krishnan Rajan | Range Aggregate Structures for Colored Geometric Objects |
| Anil Maheshwari, Jorg-Rudiger Sack, Kaveh Shahbaz and Hamid Zarrabi-Zadeh | Speed-Constrained Geodesic Fréchet Distance Inside a Simple Polygon |
| Zohreh Jabbari, William Evans and David Kirkpatrick | Optimal multi-guard covers for convex polygons |
| Jeff Sember and William Evans | k-Star-shaped Polygons |
| Robert Fraser and Patrick K. Nicholson | Hausdorff Core of a One Reflex Vertex Polygon |
| Alaa Eddien Abdallah, Thomas Fevens and Jaroslav Opatrny | 3D Local Algorithm for Dominating Sets of Unit Disk Graphs |
| Thuy Le and Bradford Nickerson | Towards a Dynamic Data Structure for Efficient Bounded Line Range Search |
| Fatemeh Panahi and Ali Mohades | Computing Minimum Limited-Capacity Matching in one-Dimensional space and for the Points Lying on Two Perpendicular Lines |
| Hoda Akbari and Mohammad Ghodsi | Visibility Maintenance of a Moving Segment Observer inside Polygons with Holes |
| Maryam Tahmasbi and S. Mehdi Hashemi | Orthogonal thickness of graphs |
| Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy and Partha P. Goswami | Cluster Connecting Problem inside a Polygon |
| Hiroyuki Miyata, Sonoko Moriyama and Komei Fukuda | Complete enumeration of small realizable oriented matroids |
| Jorge Urrutia, Canek Peláez and Adriana Ramírez-Vigueras | Triangulations with many points of even degree |
| Dhia Mahjoub, Angelika Leskovskaya and David Matula | Approximating the Independent Domatic Partition Problem in Random Geometric Graphs-An Experimental Study |
| Daniel Peterseim | Triangulating a System of Disks |
| Janardhan Kulkarni and Sathish Govindarajan | New Epsilon-Net Constructions |
| Ryuhei Uehara | On Stretch Minimization Problem on Unit Strip Paper |
| Zahed Rahmati and Alireza Zarei | Combinatorial Changes of Euclidean Minimum Spanning Tree of Moving Points in the Plane |
| Xiuxia Pan, Fajie Li and Reinhard Klette | Approximate Shortest Path Algorithms for Sequences of Pairwise Disjoint Simple Polygons |
| Ebrahim Ehsanfar, Bahram Sadeghi Bigham and Najmeh Madadi | An Optimal Solution for Dynamic Polar Diagram |
