Search results for "CCCG"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Erin W. Chambers, Kyle Sykes, Cynthia M. Traub	Unfolding Rectangle-Faced Orthostacks.	CCCG	2012	DBLP BibTeX RDF
1	Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Clemens Huemer, Alexander Pilz, Birgit Vogtenhuber	Lower Bounds for the Number of Small Convex k-Holes.	CCCG	2012	DBLP BibTeX RDF
1	Luis Felipe Barba Flores	Disk Constrained 1-Center Queries.	CCCG	2012	DBLP BibTeX RDF
1	Robert Fraser, Alejandro López-Ortiz	The Within-Strip Discrete Unit Disk Cover Problem.	CCCG	2012	DBLP BibTeX RDF
1	Oswin Aichholzer, Howard Cheng, Satyan L. Devadoss, Thomas Hackl, Stefan Huber 0001, Brian Li, Andrej Risteski	What makes a Tree a Straight Skeleton?	CCCG	2012	DBLP BibTeX RDF
1	Greg Aloupis, Robert A. Hearn, Hirokazu Iwasawa, Ryuhei Uehara	Covering Points with Disjoint Unit Disks.	CCCG	2012	DBLP BibTeX RDF
1	Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara	Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete.	CCCG	2012	DBLP BibTeX RDF
1	Shalev Ben-David, Elyot Grant, Will Ma, Malcolm Sharpe	The Approximability and Integrality Gap of Interval Stabbing and Independence Problems.	CCCG	2012	DBLP BibTeX RDF
1	Stephane Durocher, Saeed Mehrabi 0001, Matthew Skala, Mohammad Abdul Wahid	The Cover Contact Graph of Discs Touching a Line.	CCCG	2012	DBLP BibTeX RDF
1	Aaron Moss, David Bremner	Basis Enumeration of Hyperplane Arrangements Up to Symmetries.	CCCG	2012	DBLP BibTeX RDF
1	Alexis Beingessner, Michiel H. M. Smid	Computing the Coverage of an Opaque Forest.	CCCG	2012	DBLP BibTeX RDF
1	Sarah Cannon, Diane L. Souvaine, Andrew Winslow	Hidden Mobile Guards in Simple Polygons.	CCCG	2012	DBLP BibTeX RDF
1	Glencora Borradaile, David Eppstein	Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets.	CCCG	2012	DBLP BibTeX RDF
1	Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot	Competitive Routing on a Bounded-Degree Plane Spanner.	CCCG	2012	DBLP BibTeX RDF
1	Erik Krohn, Bengt J. Nilsson	The Complexity of Guarding Monotone Polygons.	CCCG	2012	DBLP BibTeX RDF
1	Stuart A. Macgillivray, Bradford G. Nickerson	A Data Structure Supporting Exclusion Persistence Range Search.	CCCG	2012	DBLP BibTeX RDF
1	Gregory Bint, Anil Maheshwari, Michiel H. M. Smid	xy-Monotone Path Existence Queries in a Rectilinear Environment.	CCCG	2012	DBLP BibTeX RDF
1	Gokarna Sharma, Costas Busch, Ramachandran Vaidyanathan, Suresh Rai, Jerry L. Trahan	An Efficient Transformation for the Klee's Measure Problem in the Streaming Model.	CCCG	2012	DBLP BibTeX RDF
1	Tomomi Matsui, Yuichiro Miyamoto	Characterizing Delaunay Graphs via Fixed Point Theorem.	CCCG	2012	DBLP BibTeX RDF
1	Braxton Carrigan, András Bezdek	Tiling Polyhedra with Tetrahedra.	CCCG	2012	DBLP BibTeX RDF
1	Hugh P. Cassidy, Thomas J. Peters, Kirk E. Jordan	Dynamic Computational Topology for Piecewise Linear Curves.	CCCG	2012	DBLP BibTeX RDF
1	Toshihiro Shirakawa, Ryuhei Uehara	Common Developments of Three Different Orthogonal Boxes.	CCCG	2012	DBLP BibTeX RDF
1	Donald R. Sheehy	A Multicover Nerve for Geometric Inference.	CCCG	2012	DBLP BibTeX RDF
1	Scott A. Mitchell, Alexander Rand, Mohamed S. Ebeida, Chandrajit L. Bajaj	Variable Radii Poisson Disk Sampling.	CCCG	2012	DBLP BibTeX RDF
1	Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot	Optimal Bounds on Theta-Graphs: More is not Always Better.	CCCG	2012	DBLP BibTeX RDF
1	Joseph S. B. Mitchell	Invited talk: Computational Geometry in Air Traffic Management.	CCCG	2012	DBLP BibTeX RDF
1	Cynthia M. Traub	Steiner Reducing Sets of Minimum Weight Triangulations.	CCCG	2012	DBLP BibTeX RDF
1	Pankaj Agarwal	Invited talk: Algorithms for Geometric Similarity.	CCCG	2012	DBLP BibTeX RDF
1	Andreia P. Guerreiro, Carlos M. Fonseca, Michael T. M. Emmerich	A Fast Dimension-Sweep Algorithm for the Hypervolume Indicator in Four Dimensions.	CCCG	2012	DBLP BibTeX RDF
1	Jeffrey M. White, Kevin A. Wortman	Divide-and-Conquer 3D Convex Hulls on the GPU.	CCCG	2012	DBLP BibTeX RDF
1	Ciprian Borcea, Ileana Streinu	Flexible Crystal Frameworks.	CCCG	2012	DBLP BibTeX RDF
1	Luc Devroye, Pat Morin	A Note on Interference in Random Networks.	CCCG	2012	DBLP BibTeX RDF
1	B. V. Subramanya Bharadwaj, Chintan Rao, Pradeesha Ashok, Sathish Govindarajan	On Piercing (Pseudo)Lines and Boxes.	CCCG	2012	DBLP BibTeX RDF
1	Luis Felipe Barba Flores, Stefan Langerman, Greg Aloupis	Circle Separability Queries in Logarithmic Time.	CCCG	2012	DBLP BibTeX RDF
1	Willi Mann, Martin Held, Stefan Huber 0001	Computing Motorcycle Graphs Based on Kinetic Triangulations.	CCCG	2012	DBLP BibTeX RDF
1	Javier Cano, Csaba D. Tóth, Jorge Urrutia	Edge Guards for Polyhedra in 3-Space.	CCCG	2012	DBLP BibTeX RDF
1	Abhijeet Khopkar, Sathish Govindarajan	Hardness Results for Computing Optimal Locally Gabriel Graphs.	CCCG	2012	DBLP BibTeX RDF
1	Günter M. Ziegler	Invited talk: Cannons at Sparrows.	CCCG	2012	DBLP BibTeX RDF
1	Eric M. Hanson, Francis C. Motta, Chris Peterson 0001, Lori Ziegelmeier	On the Strengthening of Topological Signals in Persistent Homology through Vector Bundle Based Maps.	CCCG	2012	DBLP BibTeX RDF
1	Prosenjit Bose, Vida Dujmovic, Nima Hoda, Pat Morin	Visibility Monotonic Polygon Deflation.	CCCG	2012	DBLP BibTeX RDF
1		Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012	CCCG	2012	DBLP BibTeX RDF
1	Natasa Jovanovic, Jan H. M. Korst, Zharko Aleksovski, Wil Michiels, Johan Lukkien, Emile H. L. Aarts	Finding Shadows among Disks.	CCCG	2012	DBLP BibTeX RDF
1	Maia Fraser	Tight Linear Lower Memory Bound for Local Routing in Planar Digraphs.	CCCG	2012	DBLP BibTeX RDF
1	Jérémy Barbay, Gonzalo Navarro 0001, Pablo Pérez-Lantero	Adaptive Techniques to find Optimal Planar Boxes.	CCCG	2012	DBLP BibTeX RDF
1	Anna Lubiw, Vinayak Pathak	Flip Distance Between Two Triangulations of a Point Set is NP-complete.	CCCG	2012	DBLP BibTeX RDF
1	Reza Dorrigiv, Alejandro López-Ortiz, Selim Tawfik	Optimal Average Case Strategy for Looking Around a Corner.	CCCG	2012	DBLP BibTeX RDF
1	Dan Chen 0003, Pat Morin	Approximating Majority Depth.	CCCG	2012	DBLP BibTeX RDF
1	Stephen K. Wismath, Henk Meijer	Point-Set Embedding in Three Dimensions.	CCCG	2012	DBLP BibTeX RDF
1	Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro	Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions.	CCCG	2011	DBLP BibTeX RDF
1	Tetsuo Asano, Benjamin Doerr	Memory-Constrained Algorithms for Shortest Path Problem.	CCCG	2011	DBLP BibTeX RDF
1	Boaz Ben-Moshe, Eran Omri, Michael Elkin	Optimizing Budget Allocation in Graphs.	CCCG	2011	DBLP BibTeX RDF
1	Jürgen Bokowski, Vincent Pilaud	On the generation of topological (nk)-configurations.	CCCG	2011	DBLP BibTeX RDF
1	Elisha Sacks, Victor Milenkovic, Yujun Wu	Robust approximate assembly partitioning.	CCCG	2011	DBLP BibTeX RDF
1		Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011	CCCG	2011	DBLP BibTeX RDF
1	Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides	A Note on Minimum-Segment Drawings of Planar Graphs.	CCCG	2011	DBLP BibTeX RDF
1	Fatemeh Panahi, Ali Mohades, Mansoor Davoodi, Marzieh Eskandari	Weak Matching Points with Triangles.	CCCG	2011	DBLP BibTeX RDF
1	Joseph O'Rourke, Costin Vîlcu	Development of Curves on Polyhedra via Conical Existence.	CCCG	2011	DBLP BibTeX RDF
1	Sarah Eisenstat, Erik D. Demaine	Expansive Motions for d-Dimensional Open Chains.	CCCG	2011	DBLP BibTeX RDF
1	Svetlana Stolpner, Kaleem Siddiqi, Sue Whitesides	Approximating the Medial Axis by Shooting Rays: 3D Case.	CCCG	2011	DBLP BibTeX RDF
1	David L. Millman, Vishal Verma	A Slow Algorithm for Computing the Gabriel Graph with Double Precision.	CCCG	2011	DBLP BibTeX RDF
1	André van Renssen, Bettina Speckmann	The 2x2 Simple Packing Problem.	CCCG	2011	DBLP BibTeX RDF
1	Therese Biedl	Drawing some planar graphs with integer edge-lengths.	CCCG	2011	DBLP BibTeX RDF
1	Nikolay Dimitrov	Illumination problems on translation surfaces with planar infinities.	CCCG	2011	DBLP BibTeX RDF
1	Boaz Ben-Moshe, Elazar Elkin, Harel Levi, Ayal Weissman	Improving Accuracy of GNSS Devices in Urban Canyons.	CCCG	2011	DBLP BibTeX RDF
1	Jean-Lou De Carufel, Craig Dillabaugh, Anil Maheshwari	Point Location in Well-Shaped Meshes Using Jump-and-Walk.	CCCG	2011	DBLP BibTeX RDF
1	Canek Peláez, José Miguel Díaz-Báñez, Marco A. Heredia, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura	Convex blocking and partial orders on the plane.	CCCG	2011	DBLP BibTeX RDF
1	Christian Scheffer, Jan Vahrenhold	Approximating Geodesic Distances on 2-Manifolds in R3.	CCCG	2011	DBLP BibTeX RDF
1	Erin W. Chambers, David Letscher, Tao Ju, Lu Liu 0012	Isotopic Fréchet Distance.	CCCG	2011	DBLP BibTeX RDF
1	Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan, Kishore Kothapalli	Finding Maximum Density Axes Parallel Regions for Weighted Point Sets.	CCCG	2011	DBLP BibTeX RDF
1	Marjan Abedin, Ali Mohades, Marzieh Eskandari	On Inducing n-gons.	CCCG	2011	DBLP BibTeX RDF
1	Ben D. Lund, George B. Purdy, Justin W. Smith, Csaba D. Tóth	Collinearities in Kinetic Point Sets.	CCCG	2011	DBLP BibTeX RDF
1	David G. Kirkpatrick, Irina Kostitsyna, Valentin Polishchuk	Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning.	CCCG	2011	DBLP BibTeX RDF
1	Deniz Sariöz	Approximating the Obstacle Number for a Graph Drawing Efficiently.	CCCG	2011	DBLP BibTeX RDF
1	Noga Alon	List coloring and Euclidean Ramsey Theory.	CCCG	2011	DBLP BibTeX RDF
1	Yosuke Okayama, Masashi Kiyomi, Ryuhei Uehara	On covering of any point configuration by disjoint unit disks.	CCCG	2011	DBLP BibTeX RDF
1	Peter Saveliev	Robustness of topology of digital images and point clouds.	CCCG	2011	DBLP BibTeX RDF
1	Stephane Durocher, Saeed Mehrabi 0001, Debajyoti Mondal, Matthew Skala	Realizing Site Permutations.	CCCG	2011	DBLP BibTeX RDF
1	Kai Jin, Kevin Matulef	Finding the Maximum Area Parallelogram in a Convex Polygon.	CCCG	2011	DBLP BibTeX RDF
1	Emeric Gioan, Kevin Sol, Gérard Subsol	Orientations of Simplices Determined by Orderings on the Coordinates of their Vertices.	CCCG	2011	DBLP BibTeX RDF
1	Timothy M. Chan, Bryan T. Wilkinson	Bichromatic Line Segment Intersection Counting in O(n sqrt(log n)) Time.	CCCG	2011	DBLP BibTeX RDF
1	Grant Custard, Antoine Deza, Tamon Stephen, Feng Xie	Small Octahedral Systems.	CCCG	2011	DBLP BibTeX RDF
1	Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman	Helly Numbers of Polyominoes.	CCCG	2011	DBLP BibTeX RDF
1	Carsten Lange	Combinatorics of Minkowski decomposition of associahedra.	CCCG	2011	DBLP BibTeX RDF
1	Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter	Sliding labels for dynamic point labeling.	CCCG	2011	DBLP BibTeX RDF
1	Anil Kishore Kalavagattu, Ananda Swarup Das, Kishore Kothapalli, Kannan Srinathan	On Finding Skyline Points for Range Queries in Plane.	CCCG	2011	DBLP BibTeX RDF
1	Birgit Vogtenhuber, Oswin Aichholzer, Ruy Fabila Monroy, Clemens Huemer, Jorge Urrutia, Marco A. Heredia, Hernán González-Aguilar, Thomas Hackl, Pavel Valtr 0001	On k-Gons and k-Holes in Point Sets.	CCCG	2011	DBLP BibTeX RDF
1	Hakan Yildiz, John Hershberger 0001, Subhash Suri	A Discrete and Dynamic Version of Klee's Measure Problem.	CCCG	2011	DBLP BibTeX RDF
1	Khaled M. Elbassioni, Imran Rauf, Saurabh Ray	Enumerating Minimal Transversals of Geometric Hypergraphs.	CCCG	2011	DBLP BibTeX RDF
1	Karim Douïeb, Matthew Eastman, Anil Maheshwari, Michiel H. M. Smid	Approximation Algorithms for a Triangle Enclosure Problem.	CCCG	2011	DBLP BibTeX RDF
1	Prosenjit Bose, Jean-Lou De Carufel	Isoperimetric Triangular Enclosure with a Fixed Angle.	CCCG	2011	DBLP BibTeX RDF
1	Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiroaki Matsui, Günter Rote, Ryuhei Uehara	Common Developments of Several Different Orthogonal Boxes.	CCCG	2011	DBLP BibTeX RDF
1	Chia-Hong Hsu, Chung-Shou Liao	New Lower Bounds for the Three-dimensional Orthogonal Bin Packing Problem.	CCCG	2011	DBLP BibTeX RDF
1	A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz	Bottleneck Steiner Tree with Bounded Number of Steiner Vertices.	CCCG	2011	DBLP BibTeX RDF
1	Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid	An In-Place Priority Search Tree.	CCCG	2011	DBLP BibTeX RDF
1	Salma Sadat Mahdavi, Ali Mohades, Bahram Kouhestani	Computing k-Link Visibility Polygons in Environments with a Reflective Edge.	CCCG	2011	DBLP BibTeX RDF
1	Pouya Bisadi, Bradford G. Nickerson	Orthogonal Range Search using a Distributed Computing Model.	CCCG	2011	DBLP BibTeX RDF
1	Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz 0001, Diane L. Souvaine, Andrew Winslow	Convexifying Polygons Without Losing Visibilities.	CCCG	2011	DBLP BibTeX RDF
1	Gruia Calinescu, Howard J. Karloff	Sequential Dependency Computation via Geometric Data Structures.	CCCG	2011	DBLP BibTeX RDF
1	William Steiger	Geometric Partitioning.	CCCG	2011	DBLP BibTeX RDF
1	Amit M. Bhosle, Teofilo F. Gonzalez	Finding Optimal Geodesic Bridges Between Two Simple Polygons.	CCCG	2011	DBLP BibTeX RDF

Publications at "CCCG"( http://dblp.L3S.de/Venues/CCCG )