Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar22. CCCG 2010: Winnipeg, Manitoba, Canada
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010. 2010 Fajie Li, Reinhard Klette:
Watchman route in a simple polygon with a rubberband algorithm. 1-4Zohreh Jabbari, William S. Evans, David G. Kirkpatrick:
Multi-guard covers for polygonal regions. 5-8Giovanni Viglietta, Maurizio Monge:
The 3-dimensional searchlight scheduling problem. 9-12Prosenjit Bose, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Vera Sacristán, Maria Saumell:
Some properties of higher order delaunay and gabriel graphs. 13-16Eva Kopecká, Daniel Reem, Simeon Reich:
Existence of zone diagrams in compact subsets of uniformly convex spaces. 17-20Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Alexander Pilz, Pedro Ramos, Marc J. van Kreveld, Birgit Vogtenhuber:
Blocking delaunay triangulations. 21-24David Avis:
Those ubiquitous cut polyhedra. 25Leonidas J. Guibas, Nikola Milosavljevic, Arik Motskin:
Connected dominating sets on dynamic geometric graphs. 27-30Paz Carmi, Lilach Chaitman:
Stable roommates and geometric spanners. 31-34Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opatrny:
3d local algorithm for dominating sets of unit disk graphs. 35-38Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthew J. Katz, Gila Morgenstern, Yael Stein:
Direction assignment in wireless networks. 39-42Zahed Rahmati, Alireza Zarei:
Combinatorial changes of euclidean minimum spanning tree of moving points in the plane. 43-45Marek Sulovský, Uli Wagner:
k-sets and continuous motion in R3. 47-50Ebrahim Ehsanfar, Bahram Sadeghi Bigham, Najmeh Madadi:
An optimal solution for dynamic polar diagram. 51-54Thuy Le, Bradford G. Nickerson:
Towards a dynamic data structure for efficient bounded line range search. 55-58Kimikazu Kato:
On degeneracy of lower envelopes of algebraic surfaces. 59-62David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara:
Ghost chimneys. 63-66Perouz Taslakian, Isabel Hubard:
Deflating polygons to the limit. 67-70Radoslav Fulek:
Coloring geometric hypergraph defined by an arrangement of half-planes. 71-74Minghui Jiang, Vincent Pilaud, Pedro J. Tejada:
On a dispersion problem in grid labeling. 75-78Kyle Klein, Subhash Suri:
Robot kabaddi. 79-82Erik D. Demaine, Joseph O'Rourke:
Open problem session. 83-86Thomas Hackl, Oswin Aichholzer, Birgit Vogtenhuber:
Compatible pointed pseudo-triangulations. 91-94Luca Castelli Aleardi, Éric Fusy, Thomas Lewiner:
Optimal encoding of triangular and quadrangular meshes with fixed topology. 95-98Gill 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-102Jorge Urrutia, Canek Peláez, Adriana Ramírez-Viguer:
Triangulations with many points of even degree. 103-106David L. Millman, Matthew O'Meara, Jack Snoeyink, Vishal Verma:
Maximum geodesic routing in the plane with obstacles. 107-108Braxton Carrigan:
Evading equilateral triangles without a map. 109-112Adrian Dumitrescu, Csaba D. Tóth:
Watchman tours for polygons with holes. 113-116Hoda Akbari, Mohammad Ghodsi:
Visibility maintenance of a moving segment observer inside polygons with holes. 117-120Craig Dillabaugh:
I/O efficient path traversal in well-shaped tetrahedral meshes. 121-124David Eppstein:
Regular labelings and geometric structures. 125-130Adrian Dumitrescu:
Approximate euclidean ramsey theorems. 131-134Ana Paula Malheiro, Jorge Stolfi:
Finding minimal bases in arbitrary spline spaces. 135-138Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara:
Any monotone boolean function can be realized by interlocked polygons. 139-142Hiroyuki Miyata, Sonoko Moriyama, Komei Fukuda:
Complete enumeration of small realizable oriented matroids. 143-146Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin:
Oja medians and centers of gravity. 147-150Riddhipratim Basu, Bhaswar B. Bhattacharya, Tanmoy Talukdar:
The projection median of a set of points in Rd. 151-154Pradeesha Ashok, Sathish Govindarajan, Janardhan Kulkarni:
Small strong epsilon nets. 155-158Janardhan Kulkarni, Sathish Govindarajan:
New epsilon-net constructions. 159-162Prosenjit Bose, Otfried Cheong, Vida Dujmovic:
On the perimeter of fat objects. 163-166Yonit Bousany, Mary Leah Karker, Joseph O'Rourke, Leona Sparaco:
Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup. 167-170Prosenjit Bose, Jean-Lou De Carufel:
Minimum enclosing area triangle with a fixed angle. 171-174Xiuxia Pan, Fajie Li, Reinhard Klette:
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons. 175-178Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Speed-constrained geodesic fréchet distance inside a simple polygon. 179-182Robert Fraser, Patrick K. Nicholson:
Hausdorff core of a one reflex vertex polygon. 183-186Stefan Huber, Martin Held:
Computing straight skeletons of planar straight-line graphs based on motorcycle graphs. 187-190Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Md. Jawaherul Alam:
Minimum-area drawings of plane 3-trees. 191-194Dhia Mahjoub, Angelika Leskovskaya, David W. Matula:
Approximating the independent domatic partition problem in random geometric graphs - an experimental study. 195-198Maryam Tahmasbi, S. Mehdi Hashemi:
Orthogonal thickness of graphs. 199-202Maarten Löffler, Martin Nöllenburg:
Shooting bricks with orthogonal laser beams: A first step towards internal/external map labeling. 203-206Gautam 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-210William L. Steiger, Imre Bárány:
On the variance of random polygons. 211-214Jeff Sember, William S. Evans:
k-star-shaped polygons. 215-218Anna Lubiw, Erik D. Demaine, Martin L. Demaine, Arlo Shallit, Jonah Shallit:
Zipper unfoldings of polyhedral complexes. 219-222Ryuhei Uehara:
On stretch minimization problem on unit strip paper. 223-226David G. Kirkpatrick:
Determining the robustness of sensor barriers. 227Md. Shafiul Alam, Asish Mukhopadhyay:
A new algorithm and improved lower bound for point placement on a line in two rounds. 229-232Adrian Dumitrescu, Minghui Jiang:
Constrained k-center and movement to independence. 233-236Fatemeh Panahi, Ali Mohades:
Computing minimum limited-capacity matching in one-dimensional space and for the points lying on two perpendicular lines. 237-240Bhaswar B. Bhattacharya, Subhas C. Nandy:
New variations of the reverse facility location problem. 241-244Gautam K. Das, Bradford G. Nickerson:
I/O-efficient triangular range search and its application. 245-248Saladi Rahul, Haritha Bellam, Prosenjit Gupta, Krishnan Rajan:
Range aggregate structures for colored geometric objects. 249-252Yakov Nekrich, Michiel H. M. Smid:
Approximating range-aggregate queries using coresets. 253-256Adrian Dumitrescu:
The traveling salesman problem for lines and rays in the plane. 257-260Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin:
Fast local searches and updates in bounded universes. 261-264Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami:
Cluster connecting problem inside a polygon. 265-268Farnaz Sheikhi, Mark de Berg, Ali Mohades, Mansoor Davoodi Monfared:
Finding monochromatic l-shapes in bichromatic point sets. 269-272Radoslav Fulek, Balázs Keszegh, Filip Moric, Igor Uljarevic:
On polygons excluding point sets. 273-276William Steiger, Mario Szegedy, Jihui Zhao:
Six-way equipartitioning by three lines in the plane. 277-280
last updated on 2019-10-18 23:06 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
