default search action
24. CCCG 2012: Charlottetown, Prince Edward Island, Canada
- Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012. 2012
- Pankaj Agarwal:
Invited talk: Algorithms for Geometric Similarity. 9 - Prosenjit Bose, Vida Dujmovic, Nima Hoda, Pat Morin:
Visibility Monotonic Polygon Deflation. 11-16 - Toshihiro Shirakawa, Ryuhei Uehara:
Common Developments of Three Different Orthogonal Boxes. 17-22 - Erin W. Chambers, Kyle Sykes, Cynthia M. Traub:
Unfolding Rectangle-Faced Orthostacks. 23-28 - Stuart A. Macgillivray, Bradford G. Nickerson:
A Data Structure Supporting Exclusion Persistence Range Search. 29-34 - Gregory Bint, Anil Maheshwari, Michiel H. M. Smid:
xy-Monotone Path Existence Queries in a Rectilinear Environment. 35-40 - Greg Aloupis, Robert A. Hearn, Hirokazu Iwasawa, Ryuhei Uehara:
Covering Points with Disjoint Unit Disks. 41-46 - Shalev Ben-David, Elyot Grant, Will Ma, Malcolm Sharpe:
The Approximability and Integrality Gap of Interval Stabbing and Independence Problems. 47-52 - Robert Fraser, Alejandro López-Ortiz:
The Within-Strip Discrete Unit Disk Cover Problem. 53-58 - Stephane Durocher, Saeed Mehrabi, Matthew Skala, Mohammad Abdul Wahid:
The Cover Contact Graph of Discs Touching a Line. 59-64 - B. V. Subramanya Bharadwaj, Chintan Rao, Pradeesha Ashok, Sathish Govindarajan:
On Piercing (Pseudo)Lines and Boxes. 65-70 - Jérémy Barbay, Gonzalo Navarro, Pablo Pérez-Lantero:
Adaptive Techniques to find Optimal Planar Boxes. 71-76 - Andreia P. Guerreiro, Carlos M. Fonseca, Michael T. M. Emmerich:
A Fast Dimension-Sweep Algorithm for the Hypervolume Indicator in Four Dimensions. 77-82 - Gokarna Sharma, Costas Busch, Ramachandran Vaidyanathan, Suresh Rai, Jerry L. Trahan:
An Efficient Transformation for the Klee's Measure Problem in the Streaming Model. 83-88 - Natasa Jovanovic, Jan H. M. Korst, Zharko Aleksovski, Wil Michiels, Johan Lukkien, Emile H. L. Aarts:
Finding Shadows among Disks. 89-94 - Alexis Beingessner, Michiel H. M. Smid:
Computing the Coverage of an Opaque Forest. 95-100 - Luis Felipe Barba Flores:
Disk Constrained 1-Center Queries. 107-112 - Luis Felipe Barba Flores, Stefan Langerman, Greg Aloupis:
Circle Separability Queries in Logarithmic Time. 113-118 - Anna Lubiw, Vinayak Pathak:
Flip Distance Between Two Triangulations of a Point Set is NP-complete. 119-124 - Cynthia M. Traub:
Steiner Reducing Sets of Minimum Weight Triangulations. 125-130 - Jan Vahrenhold:
On the Space Efficiency of the "Ultimate Planar Convex Hull Algorithm". 131-136 - Jeffrey M. White, Kevin A. Wortman:
Divide-and-Conquer 3D Convex Hulls on the GPU. 137-142 - Aaron Moss, David Bremner:
Basis Enumeration of Hyperplane Arrangements Up to Symmetries. 143-148 - Abhijeet Khopkar, Sathish Govindarajan:
Hardness Results for Computing Optimal Locally Gabriel Graphs. 149-154 - Javier Cano, Csaba D. Tóth, Jorge Urrutia:
Edge Guards for Polyhedra in 3-Space. 155-160 - Sarah Cannon, Diane L. Souvaine, Andrew Winslow:
Hidden Mobile Guards in Simple Polygons. 161-166 - Erik Krohn, Bengt J. Nilsson:
The Complexity of Guarding Monotone Polygons. 167-172 - Audrey Lee-St. John:
Kinematic Joint Recognition in CAD Constraint Systems. 173-178 - Willi Mann, Martin Held, Stefan Huber:
Computing Motorcycle Graphs Based on Kinetic Triangulations. 179-184 - Scott A. Mitchell, Alexander Rand, Mohamed S. Ebeida, Chandrajit L. Bajaj:
Variable Radii Poisson Disk Sampling. 185-190 - Günter M. Ziegler:
Invited talk: Cannons at Sparrows. 191 - Luc Devroye, Pat Morin:
A Note on Interference in Random Networks. 193-198 - Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
On Farthest-Point Information in Networks. 199-204 - Maia Fraser:
Tight Linear Lower Memory Bound for Local Routing in Planar Digraphs. 205-210 - Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara:
Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete. 211-216 - Braxton Carrigan, András Bezdek:
Tiling Polyhedra with Tetrahedra. 217-222 - Stephen K. Wismath, Henk Meijer:
Point-Set Embedding in Three Dimensions. 223-228 - Dan Chen, Pat Morin:
Approximating Majority Depth. 229-234 - Ciprian Borcea, Ileana Streinu:
Flexible Crystal Frameworks. 235-240 - Tomomi Matsui, Yuichiro Miyamoto:
Characterizing Delaunay Graphs via Fixed Point Theorem. 241-246 - Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Clemens Huemer, Alexander Pilz, Birgit Vogtenhuber:
Lower Bounds for the Number of Small Convex k-Holes. 247-252 - Oswin Aichholzer, Howard Cheng, Satyan L. Devadoss, Thomas Hackl, Stefan Huber, Brian Li, Andrej Risteski:
What makes a Tree a Straight Skeleton? 253-258 - Denis Khromov, Leonid M. Mestetskiy:
3D Skeletonization as an Optimization Problem. 259-264 - Hugh P. Cassidy, Thomas J. Peters, Kirk E. Jordan:
Dynamic Computational Topology for Piecewise Linear Curves. 265-270 - Bahman Kalantari:
Finding a Lost Treasure in Convex Hull of Points From Known Distances. 271-276 - Reza Dorrigiv, Alejandro López-Ortiz, Selim Tawfik:
Optimal Average Case Strategy for Looking Around a Corner. 277-282 - Joseph S. B. Mitchell:
Invited talk: Computational Geometry in Air Traffic Management. 283 - Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive Routing on a Bounded-Degree Plane Spanner. 285-290 - Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot:
Optimal Bounds on Theta-Graphs: More is not Always Better. 291-296 - Glencora Borradaile, David Eppstein:
Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets. 297-302 - Eric M. Hanson, Francis C. Motta, Chris Peterson, Lori Ziegelmeier:
On the Strengthening of Topological Signals in Persistent Homology through Vector Bundle Based Maps. 303-308 - Donald R. Sheehy:
A Multicover Nerve for Geometric Inference. 309-314
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-19 22:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: