22. CCCG 2010: Winnipeg, Manitoba, Canada
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010. 2010- Zohreh Jabbari, William S. Evans, David G. Kirkpatrick: Multi-guard covers for polygonal regions. 5-8
- Prosenjit Bose, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Vera Sacristan, Maria Saumell: Some properties of higher order delaunay and gabriel graphs. 13-16
- Eva Kopecká, Daniel Reem, Simeon Reich: Existence of zone diagrams in compact subsets of uniformly convex spaces. 17-20
- Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Alexander Pilz, Pedro Ramos, Marc J. van Kreveld, Birgit Vogtenhuber: Blocking delaunay triangulations. 21-24
- David Avis: Those ubiquitous cut polyhedra. 25
- Leonidas J. Guibas, Nikola Milosavljevic, Arik Motskin: Connected dominating sets on dynamic geometric graphs. 27-30
- Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opatrny: 3d local algorithm for dominating sets of unit disk graphs. 35-38
- Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthew J. Katz, Gila Morgenstern, Yael Stein: Direction assignment in wireless networks. 39-42
- Zahed Rahmati, Alireza Zarei: Combinatorial changes of euclidean minimum spanning tree of moving points in the plane. 43-45
- Ebrahim Ehsanfar, Bahram Sadeghi Bigham, Najmeh Madadi: An optimal solution for dynamic polar diagram. 51-54
- Thuy Le, Bradford G. Nickerson: Towards a dynamic data structure for efficient bounded line range search. 55-58
- Kimikazu Kato: On degeneracy of lower envelopes of algebraic surfaces. 59-62
- David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara: Ghost chimneys. 63-66
- Radoslav Fulek: Coloring geometric hypergraph defined by an arrangement of half-planes. 71-74
- Luca Castelli Aleardi, Éric Fusy, Thomas Lewiner: Optimal encoding of triangular and quadrangular meshes with fixed topology. 95-98
- Gill Barequet, Nadia Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow: Bounded-degree polyhedronization of point sets. 99-102
- Jorge Urrutia, Canek Peláez, Adriana Ramírez-Viguer: Triangulations with many points of even degree. 103-106
- David L. Millman, Matthew O'Meara, Jack Snoeyink, Vishal Verma: Maximum geodesic routing in the plane with obstacles. 107-108
- Braxton Carrigan: Evading equilateral triangles without a map. 109-112
- Hoda Akbari, Mohammad Ghodsi: Visibility maintenance of a moving segment observer inside polygons with holes. 117-120
- Craig Dillabaugh: I/O efficient path traversal in well-shaped tetrahedral meshes. 121-124
- David Eppstein: Regular labelings and geometric structures. 125-130
- Adrian Dumitrescu: Approximate euclidean ramsey theorems. 131-134
- Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara: Any monotone boolean function can be realized by interlocked polygons. 139-142
- Hiroyuki Miyata, Sonoko Moriyama, Komei Fukuda: Complete enumeration of small realizable oriented matroids. 143-146
- Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin: Oja medians and centers of gravity. 147-150
- Riddhipratim Basu, Bhaswar B. Bhattacharya, Tanmoy Talukdar: The projection median of a set of points in Rd. 151-154
- Yonit Bousany, Mary Leah Karker, Joseph O'Rourke, Leona Sparaco: Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup. 167-170
- Xiuxia Pan, Fajie Li, Reinhard Klette: Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons. 175-178
- Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh: Speed-constrained geodesic fréchet distance inside a simple polygon. 179-182
- Stefan Huber, Martin Held: Computing straight skeletons of planar straight-line graphs based on motorcycle graphs. 187-190
- Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Md. Jawaherul Alam: Minimum-area drawings of plane 3-trees. 191-194
- Dhia Mahjoub, Angelika Leskovskaya, David W. Matula: Approximating the independent domatic partition problem in random geometric graphs - an experimental study. 195-198
- Maarten Löffler, Martin Nöllenburg: Shooting bricks with orthogonal laser beams: A first step towards internal/external map labeling. 203-206
- Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy, Sangameswar Patil, S. V. Rao: Computing the straight skeleton of a monotone polygon in O(n log n) time. 207-210
- Anna Lubiw, Erik D. Demaine, Martin L. Demaine, Arlo Shallit, Jonah Shallit: Zipper unfoldings of polyhedral complexes. 219-222
- Ryuhei Uehara: On stretch minimization problem on unit strip paper. 223-226
- David G. Kirkpatrick: Determining the robustness of sensor barriers. 227
- Md. Shafiul Alam, Asish Mukhopadhyay: A new algorithm and improved lower bound for point placement on a line in two rounds. 229-232
- Fatemeh Panahi, Ali Mohades: Computing minimum limited-capacity matching in one-dimensional space and for the points lying on two perpendicular lines. 237-240
- Bhaswar B. Bhattacharya, Subhas C. Nandy: New variations of the reverse facility location problem. 241-244
- Gautam K. Das, Bradford G. Nickerson: I/O-efficient triangular range search and its application. 245-248
- Saladi Rahul, Haritha Bellam, Prosenjit Gupta, Krishnan Rajan: Range aggregate structures for colored geometric objects. 249-252
- Adrian Dumitrescu: The traveling salesman problem for lines and rays in the plane. 257-260
- Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin: Fast local searches and updates in bounded universes. 261-264
- Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami: Cluster connecting problem inside a polygon. 265-268
- Farnaz Sheikhi, Mark de Berg, Ali Mohades, Mansoor Davoodi Monfared: Finding monochromatic l-shapes in bichromatic point sets. 269-272
- Radoslav Fulek, Balázs Keszegh, Filip Moric, Igor Uljarevic: On polygons excluding point sets. 273-276
- William Steiger, Mario Szegedy, Jihui Zhao: Six-way equipartitioning by three lines in the plane. 277-280
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team