Search results for "CCCG"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Stefan Huber 0001, Martin Held	Approximating a Motorcycle Graph by a Straight Skeleton.	CCCG	2011	DBLP BibTeX RDF
1	Tobias Christ, Michael Hoffmann 0001	Wireless Localization within Orthogonal Polyhedra.	CCCG	2011	DBLP BibTeX RDF
1	Md. Ashraful Alam, Igor Rivin, Ileana Streinu	Outerplanar graphs and Delaunay triangulations.	CCCG	2011	DBLP BibTeX RDF
1	David Rappaport, Godfried T. Toussaint, Mustafa Mohamad	Minimum Many to Many Matchings for Computing the Distance Between Two Sequences.	CCCG	2011	DBLP BibTeX RDF
1	Sherif Ghali	Geometry-Free Polygon Splitting.	CCCG	2011	DBLP BibTeX RDF
1	Greg Aloupis, Mirela Damian, Robin Y. Flatland, Matias Korman, Özgür Özkan, David Rappaport, Stefanie Wuhrer	Establishing Strong Connectivity using Optimal Radius Half-Disk Antennas.	CCCG	2011	DBLP BibTeX RDF
1	Mojtaba Nouri Bygi, Mohammad Ghodsi	Weak Visibility Queries in Simple Polygons.	CCCG	2011	DBLP BibTeX RDF
1	Khuong Vu, Rong Zheng 0001	An Incremental Algorithm for High Order Maximum Voronoi Diagram Construction.	CCCG	2011	DBLP BibTeX RDF
1	Ge Xia, Liang Zhang	Toward the Tight Bound of the Stretch Factor of Delaunay Triangulations.	CCCG	2011	DBLP BibTeX RDF
1	Gutemberg Guerra-Filho, Pedro J. de Rezende	Characterization of Shortest Paths on Directional Frictional Polyhedral Surfaces.	CCCG	2011	DBLP BibTeX RDF
1	Minati De, Gautam K. Das, Subhas C. Nandy	Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks.	CCCG	2011	DBLP BibTeX RDF
1	Alexander Rand	Where and How Chew's Second Delaunay Refinement Algorithm Works.	CCCG	2011	DBLP BibTeX RDF
1	Xiaoye Jiang, Jian Sun 0002, Leonidas J. Guibas	A Fourier-Theoretic Approach for Inferring Symmetries.	CCCG	2011	DBLP BibTeX RDF
1	Minati De, Subhas C. Nandy	Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D.	CCCG	2011	DBLP BibTeX RDF
1	Matthew Berardi, Brent Heeringa, Justin Malestein, Louis Theran	Rigid components in fixed-lattice and cone frameworks.	CCCG	2011	DBLP BibTeX RDF
1	Zachary Abel, Erik D. Demaine	Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete.	CCCG	2011	DBLP BibTeX RDF
1	Dan Chen 0003, Pat Morin	Algorithms for Bivariate Majority Depth.	CCCG	2011	DBLP BibTeX RDF
1	Giovanni Viglietta, Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anastasia Kurdia, Joseph O'Rourke, Godfried T. Toussaint, Jorge Urrutia	Edge-guarding Orthogonal Polyhedra.	CCCG	2011	DBLP BibTeX RDF
1	Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh	Staying Close to a Curve.	CCCG	2011	DBLP BibTeX RDF
1	Timothy Sun	Rigidity-Theoretic Constructions of Integral Fary Embeddings.	CCCG	2011	DBLP BibTeX RDF
1	Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan	Detecting VLSI Layout, Connectivity Errors in a Query Window.	CCCG	2011	DBLP BibTeX RDF
1	Martin Held, Willi Mann	An Experimental Analysis of Floating-Point Versus Exact Arithmetic.	CCCG	2011	DBLP BibTeX RDF
1	Emo Welzl	Counting Simple Polygonizations of Planar Point Sets.	CCCG	2011	DBLP BibTeX RDF
1	Jeff Sember, William S. Evans	The Possible Hull of Imprecise Points.	CCCG	2011	DBLP BibTeX RDF
1	Takashi Horiyama, Wataru Shoji	Edge Unfoldings of Platonic Solids Never Overlap.	CCCG	2011	DBLP BibTeX RDF
1	David Bremner, Antoine Deza, William Hua, Lars Schewe	Pushing the boundaries of polytopal realizability.	CCCG	2011	DBLP BibTeX RDF
1	Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot	Making triangulations 4-connected using flips.	CCCG	2011	DBLP BibTeX RDF
1	Brandon Rowekamp	Planar Pixelations, Shape Reconstruction.	CCCG	2011	DBLP BibTeX RDF
1	Chen Gu, Xiaoye Jiang, Leonidas J. Guibas	Kinetically-aware Conformational Distances in Molecular Dynamics.	CCCG	2011	DBLP BibTeX RDF
1	MohammadAmin Fazli, MohammadAli Safari, Nima Anari, Pooya Jalaly Khalilabadi, Mohammad Ghodsi	Euclidean Movement Minimization.	CCCG	2011	DBLP BibTeX RDF
1	Csaba D. Tóth, Godfried T. Toussaint, Andrew Winslow	Open Guard Edges and Edge Guards in Simple Polygons.	CCCG	2011	DBLP BibTeX RDF
1	Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner	Connecting Two Trees with Optimal Routing Cost.	CCCG	2011	DBLP BibTeX RDF
1	Elyot Grant, Timothy M. Chan	Exact Algorithms and APX-Hardness Results for Geometric Set Cover.	CCCG	2011	DBLP BibTeX RDF
1	Zachary Abel, Erik D. Demaine, Martin L. Demaine	A Topologically Convex Vertex-Ununfoldable Polyhedron.	CCCG	2011	DBLP BibTeX RDF
1	Abbas Mehrabian	A Randomly Embedded Random Graph is Not a Spanner.	CCCG	2011	DBLP BibTeX RDF
1	Dan Chen 0003, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin	Oja medians and centers of gravity.	CCCG	2010	DBLP BibTeX RDF
1	Jeff Sember, William S. Evans	k-star-shaped polygons.	CCCG	2010	DBLP BibTeX RDF
1	Radoslav Fulek, Balázs Keszegh, Filip Moric, Igor Uljarevic	On polygons excluding point sets.	CCCG	2010	DBLP BibTeX RDF
1	Erik D. Demaine, Joseph O'Rourke	Open problem session.	CCCG	2010	DBLP BibTeX RDF
1	Ebrahim Ehsanfar, Bahram Sadeghi Bigham, Najmeh Madadi	An optimal solution for dynamic polar diagram.	CCCG	2010	DBLP BibTeX RDF
1	Leonidas J. Guibas, Nikola Milosavljevic, Arik Motskin	Connected dominating sets on dynamic geometric graphs.	CCCG	2010	DBLP BibTeX RDF
1	Riddhipratim Basu, Bhaswar B. Bhattacharya, Tanmoy Talukdar	The projection median of a set of points in Rd.	CCCG	2010	DBLP BibTeX RDF
1	Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthew J. Katz, Gila Morgenstern, Yael Stein	Direction assignment in wireless networks.	CCCG	2010	DBLP BibTeX RDF
1	Yonit Bousany, Mary Leah Karker, Joseph O'Rourke, Leona Sparaco	Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup.	CCCG	2010	DBLP BibTeX RDF
1	Dhia Mahjoub, Angelika Leskovskaya, David W. Matula	Approximating the independent domatic partition problem in random geometric graphs - an experimental study.	CCCG	2010	DBLP BibTeX RDF
1	Adrian Dumitrescu	Approximate euclidean ramsey theorems.	CCCG	2010	DBLP BibTeX RDF
1	Gill Barequet, Nadia M. Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz 0001, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow	Bounded-degree polyhedronization of point sets.	CCCG	2010	DBLP BibTeX RDF
1	Prosenjit Bose, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Vera Sacristán, Maria Saumell	Some properties of higher order delaunay and gabriel graphs.	CCCG	2010	DBLP BibTeX RDF
1	Zohreh Jabbari, William S. Evans, David G. Kirkpatrick	Multi-guard covers for polygonal regions.	CCCG	2010	DBLP BibTeX RDF
1	Gautam K. Das, Bradford G. Nickerson	I/O-efficient triangular range search and its application.	CCCG	2010	DBLP BibTeX RDF
1	Hoda Akbari, Mohammad Ghodsi	Visibility maintenance of a moving segment observer inside polygons with holes.	CCCG	2010	DBLP BibTeX RDF
1	David G. Kirkpatrick	Determining the robustness of sensor barriers.	CCCG	2010	DBLP BibTeX RDF
1	Jorge Urrutia, Canek Peláez, Adriana Ramírez-Viguer	Triangulations with many points of even degree.	CCCG	2010	DBLP BibTeX RDF
1	Maarten Löffler, Martin Nöllenburg	Shooting bricks with orthogonal laser beams: A first step towards internal/external map labeling.	CCCG	2010	DBLP BibTeX RDF
1	Adrian Dumitrescu	The traveling salesman problem for lines and rays in the plane.	CCCG	2010	DBLP BibTeX RDF
1	Thomas Hackl, Oswin Aichholzer, Birgit Vogtenhuber	Compatible pointed pseudo-triangulations.	CCCG	2010	DBLP BibTeX RDF
1	Anna Lubiw, Erik D. Demaine, Martin L. Demaine, Arlo Shallit, Jonah Shallit	Zipper unfoldings of polyhedral complexes.	CCCG	2010	DBLP BibTeX RDF
1	Bhaswar B. Bhattacharya, Subhas C. Nandy	New variations of the reverse facility location problem.	CCCG	2010	DBLP BibTeX RDF
1	David L. Millman, Matthew O'Meara, Jack Snoeyink, Vishal Verma	Maximum geodesic routing in the plane with obstacles.	CCCG	2010	DBLP BibTeX RDF
1	Paz Carmi, Lilach Chaitman	Stable roommates and geometric spanners.	CCCG	2010	DBLP BibTeX RDF
1	David Avis	Those ubiquitous cut polyhedra.	CCCG	2010	DBLP BibTeX RDF
1	Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin	Fast local searches and updates in bounded universes.	CCCG	2010	DBLP BibTeX RDF
1	Eva Kopecká, Daniel Reem, Simeon Reich	Existence of zone diagrams in compact subsets of uniformly convex spaces.	CCCG	2010	DBLP BibTeX RDF
1	Zahed Rahmati, Alireza Zarei	Combinatorial changes of euclidean minimum spanning tree of moving points in the plane.	CCCG	2010	DBLP BibTeX RDF
1	Saladi Rahul, Haritha Bellam, Prosenjit Gupta, Krishnan Rajan	Range aggregate structures for colored geometric objects.	CCCG	2010	DBLP BibTeX RDF
1	David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara	Ghost chimneys.	CCCG	2010	DBLP BibTeX RDF
1	Ryuhei Uehara	On stretch minimization problem on unit strip paper.	CCCG	2010	DBLP BibTeX RDF
1	Xiuxia Pan, Fajie Li, Reinhard Klette	Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons.	CCCG	2010	DBLP BibTeX RDF
1	Marek Sulovský, Uli Wagner 0001	k-sets and continuous motion in R3.	CCCG	2010	DBLP BibTeX RDF
1	Robert Fraser, Patrick K. Nicholson	Hausdorff core of a one reflex vertex polygon.	CCCG	2010	DBLP BibTeX RDF
1	Kimikazu Kato	On degeneracy of lower envelopes of algebraic surfaces.	CCCG	2010	DBLP BibTeX RDF
1	Craig Dillabaugh	I/O efficient path traversal in well-shaped tetrahedral meshes.	CCCG	2010	DBLP BibTeX RDF
1	Thuy Le, Bradford G. Nickerson	Towards a dynamic data structure for efficient bounded line range search.	CCCG	2010	DBLP BibTeX RDF
1	Fajie Li, Reinhard Klette	Watchman route in a simple polygon with a rubberband algorithm.	CCCG	2010	DBLP BibTeX RDF
1	Adrian Dumitrescu, Minghui Jiang 0001	Constrained k-center and movement to independence.	CCCG	2010	DBLP BibTeX RDF
1	Prosenjit Bose, Otfried Cheong, Vida Dujmovic	On the perimeter of fat objects.	CCCG	2010	DBLP BibTeX RDF
1	Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman 0001, Md. Jawaherul Alam	Minimum-area drawings of plane 3-trees.	CCCG	2010	DBLP BibTeX RDF
1	William Steiger, Mario Szegedy, Jihui Zhao	Six-way equipartitioning by three lines in the plane.	CCCG	2010	DBLP BibTeX RDF
1	Yakov Nekrich, Michiel H. M. Smid	Approximating range-aggregate queries using coresets.	CCCG	2010	DBLP BibTeX RDF
1	Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami	Cluster connecting problem inside a polygon.	CCCG	2010	DBLP BibTeX RDF
1	Luca Castelli Aleardi, Éric Fusy, Thomas Lewiner	Optimal encoding of triangular and quadrangular meshes with fixed topology.	CCCG	2010	DBLP BibTeX RDF
1	Kyle Klein, Subhash Suri	Robot kabaddi.	CCCG	2010	DBLP BibTeX RDF
1	Radoslav Fulek	Coloring geometric hypergraph defined by an arrangement of half-planes.	CCCG	2010	DBLP BibTeX RDF
1	Fatemeh Panahi, Ali Mohades	Computing minimum limited-capacity matching in one-dimensional space and for the points lying on two perpendicular lines.	CCCG	2010	DBLP BibTeX RDF
1	Ana Paula Malheiro, Jorge Stolfi	Finding minimal bases in arbitrary spline spaces.	CCCG	2010	DBLP BibTeX RDF
1	Prosenjit Bose, Jean-Lou De Carufel	Minimum enclosing area triangle with a fixed angle.	CCCG	2010	DBLP BibTeX RDF
1	Pradeesha Ashok, Sathish Govindarajan, Janardhan Kulkarni	Small strong epsilon nets.	CCCG	2010	DBLP BibTeX RDF
1	Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy, Sangameswar Patil, S. V. Rao 0001	Computing the straight skeleton of a monotone polygon in O(n log n) time.	CCCG	2010	DBLP BibTeX RDF
1	Braxton Carrigan	Evading equilateral triangles without a map.	CCCG	2010	DBLP BibTeX RDF
1	William L. Steiger, Imre Bárány	On the variance of random polygons.	CCCG	2010	DBLP BibTeX RDF
1	David Eppstein	Regular labelings and geometric structures.	CCCG	2010	DBLP BibTeX RDF
1	Adrian Dumitrescu, Csaba D. Tóth	Watchman tours for polygons with holes.	CCCG	2010	DBLP BibTeX RDF
1	Perouz Taslakian, Isabel Hubard	Deflating polygons to the limit.	CCCG	2010	DBLP BibTeX RDF
1	Minghui Jiang 0001, Vincent Pilaud, Pedro J. Tejada	On a dispersion problem in grid labeling.	CCCG	2010	DBLP BibTeX RDF
1	Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara	Any monotone boolean function can be realized by interlocked polygons.	CCCG	2010	DBLP BibTeX RDF
1	Giovanni Viglietta, Maurizio Monge	The 3-dimensional searchlight scheduling problem.	CCCG	2010	DBLP BibTeX RDF
1	Hiroyuki Miyata, Sonoko Moriyama, Komei Fukuda	Complete enumeration of small realizable oriented matroids.	CCCG	2010	DBLP BibTeX RDF
1	Farnaz Sheikhi, Mark de Berg, Ali Mohades, Mansoor Davoodi Monfared	Finding monochromatic l-shapes in bichromatic point sets.	CCCG	2010	DBLP BibTeX RDF
1	Janardhan Kulkarni, Sathish Govindarajan	New epsilon-net constructions.	CCCG	2010	DBLP BibTeX RDF
1	Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opatrny	3d local algorithm for dominating sets of unit disk graphs.	CCCG	2010	DBLP BibTeX RDF

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