Search results for "CCCG"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Tsunehiko Kameda, John Z. Zhang, Masafumi Yamashita	Characterization of Polygons Searchable by a Boundary 1-Searcher.	CCCG	2006	DBLP BibTeX RDF
1	Kebin Wang, Shang-Hua Teng	Geometric Separator for d-Dimensional Ball Graphs.	CCCG	2006	DBLP BibTeX RDF
1	Prosenjit Bose, Jason Morrison	Optimal Polygon Placement.	CCCG	2006	DBLP BibTeX RDF
1	Rafa Absar, Sue Whitesides	On Computing Shortest External Watchman Routes for Convex Polygons.	CCCG	2006	DBLP BibTeX RDF
1	Wei Li 0011, Karen Daniels, Konstantin A. Rybnikov	A Study of Conway's Thrackle Conjecture.	CCCG	2006	DBLP BibTeX RDF
1	Rossen Atanassov, Pat Morin, Stefanie Wuhrer	Removing Outliers to Minimize Area and Perimeter.	CCCG	2006	DBLP BibTeX RDF
1	Hüseyin Akcan, Hervé Brönnimann, Robert Marini	Practical and Efficient Geometric Epsilon-Approximations.	CCCG	2006	DBLP BibTeX RDF
1	Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Shi, Tsunehiko Kameda	An Optimal Solution to Room Search Problem.	CCCG	2006	DBLP BibTeX RDF
1	Yurai Núñez Rodríguez, David Rappaport	Tight Bounds for Point Recolouring.	CCCG	2006	DBLP BibTeX RDF
1	Jonathan Backer, David G. Kirkpatrick	Bounded-Curvature Path Normalization.	CCCG	2006	DBLP BibTeX RDF
1	Sada Narayanappa, Petr Vojtechovský	An Improved Approximation Factor For The Unit Disk Covering Problem.	CCCG	2006	DBLP BibTeX RDF
1	Mirela Ben-Chen, Craig Gotsman, Steven J. Gortler	Routing with Guaranteed Delivery on Virtual Coordinates.	CCCG	2006	DBLP BibTeX RDF
1	Bradford G. Nickerson, Qingxiu Shi	K-Nearest Neighbor Search using the Pyramid Technique.	CCCG	2006	DBLP BibTeX RDF
1		Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006, August 14-16, 2006, Queen's University, Ontario, Canada	CCCG	2006	DBLP BibTeX RDF
1	Hazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang	Predicates for Line Transversals in 3D.	CCCG	2006	DBLP BibTeX RDF
1	Dominique Michelucci, Sebti Foufou, Loïc Lamarque, David Ménegaux	Another Paradigm for Geometric Constraints Solving.	CCCG	2006	DBLP BibTeX RDF
1	Csaba D. Tóth, Michael Hoffmann 0001	Spanning trees across axis-parallel segments.	CCCG	2006	DBLP BibTeX RDF
1	Erik D. Demaine, Joseph O'Rourke	Open Problems: Open Problems from CCCG 2005.	CCCG	2006	DBLP BibTeX RDF
1	Jeff M. Phillips, Pankaj K. Agarwal	On Bipartite Matching under the RMS Distance.	CCCG	2006	DBLP BibTeX RDF
1	Dania El-Khechen, Thomas Fevens, John Iacono	Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large n.	CCCG	2006	DBLP BibTeX RDF
1	Gill Barequet, Craig Gotsman, Avishay Sidlesky	Polygon Reconstruction from Line Cross-Sections.	CCCG	2006	DBLP BibTeX RDF
1	Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, Godfried T. Toussaint	Polygons Flip Finitely: Flaws and a Fix.	CCCG	2006	DBLP BibTeX RDF
1	Ryuhei Uehara, Sachio Teramoto	The Complexity of a Pop-Up Book.	CCCG	2006	DBLP BibTeX RDF
1	Bradford G. Nickerson, Qingxiu Shi	The PKD-tree for Orthogonal d-Dimensional Range Search.	CCCG	2006	DBLP BibTeX RDF
1	Maarten H. van Emden, Belaid Moa	Computational Euclid.	CCCG	2006	DBLP BibTeX RDF
1	Jan Tusch, Stefan Schirra	Experimental Comparison of the Cost of Approximate and Exact Convex Hull Computation in the Plane.	CCCG	2006	DBLP BibTeX RDF
1	Sherif Ghali, Chris Smith	Computing the Boundary of a Class of Labeled-Leaf BSP Solids.	CCCG	2005	DBLP BibTeX RDF
1	Prosenjit Bose, Jason Morrison	Translating a Star over a Point Set.	CCCG	2005	DBLP BibTeX RDF
1	Christophe Weibel, Komei Fukuda	Computing faces up to k dimensions of a Minkowski Sum of Polytopes.	CCCG	2005	DBLP BibTeX RDF
1	Robert Benkoczi, Binay K. Bhattacharya, Sandip Das 0001, Jeff Sember	Collection depot location problem in the plane.	CCCG	2005	DBLP BibTeX RDF
1	Amr Elmasry, Khaled M. Elbassioni	Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane.	CCCG	2005	DBLP BibTeX RDF
1	Chris Worman, Boting Yang	On the Computation and Chromatic Number of Colored Domino Tilings.	CCCG	2005	DBLP BibTeX RDF
1		Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG'05, University of Windsor, Ontario, Canada, August 10-12, 2005	CCCG	2005	DBLP BibTeX RDF
1	Nejib Zaguia, Guy-Vincent Jourdan, Mustafa Alhashem	On the Pagenumber of Bipartite Orders.	CCCG	2005	DBLP BibTeX RDF
1	Kathryn Duffy, Chris McAloney, Henk Meijer, David Rappaport	Closest Segments.	CCCG	2005	DBLP BibTeX RDF
1	Ramaswamy Chandrasekaran, Ovidiu Daescu, Jun Luo 0008	Cutting Out Polygons.	CCCG	2005	DBLP BibTeX RDF
1	Therese C. Biedl	The complexity of domino tiling.	CCCG	2005	DBLP BibTeX RDF
1	Craig Falls, Yuanxin Liu, Jack Snoeyink, Diane L. Souvaine	Testing Shortcuts to Maintain Simplicity in Subdivision Simplification.	CCCG	2005	DBLP BibTeX RDF
1	Jack Snoeyink, Ileana Streinu	Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time.	CCCG	2005	DBLP BibTeX RDF
1	Shin-ichi Tanigawa, Naoki Katoh	Finding a triangular mesh with a constant number of different edge lengths.	CCCG	2005	DBLP BibTeX RDF
1	Robert L. Scot Drysdale, Clifford Stein 0001, David P. Wagner	An O(n5/2log n) Algorithm for the Rectilinear Minimum Link-Distance Problem.	CCCG	2005	DBLP BibTeX RDF
1	Gill Barequet, Jonathan Naor	Large k-D Simplices in the d-Dimensional Cube.	CCCG	2005	DBLP BibTeX RDF
1	Michael A. Burr, Alexandra Lauric, Katelyn Mann	Searching for the Center of an Ellipse.	CCCG	2005	DBLP BibTeX RDF
1	Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer	Dynamic updates of succinct triangulations.	CCCG	2005	DBLP BibTeX RDF
1	Kumar Gaurav Bijay, Antoine Vigneron	A practical approach to approximating diameter of point-set in low dimensions.	CCCG	2005	DBLP BibTeX RDF
1	Mirela Damian, Robin Y. Flatland, Joseph O'Rourke	Unfolding Manhattan Towers.	CCCG	2005	DBLP BibTeX RDF
1	James Factor	Designing Modern Linkages to Trace Bezier Curves.	CCCG	2005	DBLP BibTeX RDF
1	Maike Buchin, Joachim Giesen	Minimizing the Total Absolute Gaussian Curvature in a Terrain is Hard.	CCCG	2005	DBLP BibTeX RDF
1	Dominique Michelucci, Sebti Foufou, Loïc Lamarque, David Ménegaux	Bernstein based arithmetic featuring de Casteljau.	CCCG	2005	DBLP BibTeX RDF
1	Therese C. Biedl, Franz-Josef Brandenburg	Drawing planar bipartite graphs with small area.	CCCG	2005	DBLP BibTeX RDF
1	Démian Nave, Nikos Chrisochoides	Boundary Refinement in Delaunay Mesh Generation Using Arbitrarily Ordered Vertex Insertion.	CCCG	2005	DBLP BibTeX RDF
1	Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber	Matching Edges and Faces in Polygonal Partitions.	CCCG	2005	DBLP BibTeX RDF
1	Jonathan Lenchner, Hervé Brönnimann	Observations and Computations in Sylvester-Gallai Theory.	CCCG	2005	DBLP BibTeX RDF
1	Daya Ram Gaur, Ramesh Krishnamurti	Faster approximation algorithms for scheduling tasks with a choice of start times.	CCCG	2005	DBLP BibTeX RDF
1	Subhashis Majumder, Bhargab B. Bhattacharya	Density or Discrepancy: A VLSI Designer's Dilemma in Hot Spot Analysis.	CCCG	2005	DBLP BibTeX RDF
1	Therese C. Biedl, Joseph Douglas Horton, Alejandro López-Ortiz	Cross-Stitching Using Little Thread.	CCCG	2005	DBLP BibTeX RDF
1	Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi	Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles.	CCCG	2005	DBLP BibTeX RDF
1	N. Madhusudhanan, Prosenjit Gupta, Abhijit Mitra	Efficient Algorithms for Range Queries in Protein Sequence Analysis.	CCCG	2005	DBLP BibTeX RDF
1	Stephane Durocher, David G. Kirkpatrick	The Projection Median of a Set of Points in R2.	CCCG	2005	DBLP BibTeX RDF
1	Kevin Buchin, Joachim Giesen	Flow Complex: General Structure and Algorithm.	CCCG	2005	DBLP BibTeX RDF
1	Jack Snoeyink	Maximum Independent Set for Intervals by Divide-Prune-and-Conquer.	CCCG	2005	DBLP BibTeX RDF
1	Lilian Buzer	The min-# problem, a hybrid error criterion for near linear time performance.	CCCG	2005	DBLP BibTeX RDF
1	Andreas Spillner 0001	Optimal convex partitions of point sets with few inner points.	CCCG	2005	DBLP BibTeX RDF
1	Timothy M. Chan, Abdullah-Al Mahmood	Approximating the piercing number for unit-height rectangles.	CCCG	2005	DBLP BibTeX RDF
1	Peyman Afshani, Timothy M. Chan	Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs.	CCCG	2005	DBLP BibTeX RDF
1	Audrey Lee, Ileana Streinu, Louis Theran	Finding and Maintaining Rigid Components.	CCCG	2005	DBLP BibTeX RDF
1	Raquel Viaña	Compactly Encoding and Decoding the Connectivity of a Plane Graph in Linear Time.	CCCG	2005	DBLP BibTeX RDF
1	Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura	Reverse facility location problems.	CCCG	2005	DBLP BibTeX RDF
1	Jean-Daniel Boissonnat, Camille Wormser, Mariette Yvinec	Anisotropic Diagrams: Labelle Shewchuk approach revisited.	CCCG	2005	DBLP BibTeX RDF
1	Stirling Chow, Frank Ruskey	Area-Proportional Drawings of Intersecting Families of Simple Closed Curves.	CCCG	2005	DBLP BibTeX RDF
1	Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop	Pricing of Geometric Transportation Networks.	CCCG	2005	DBLP BibTeX RDF
1	Timothy G. Abbott, Erik D. Demaine, Martin L. Demaine, Daniel Kane 0001, Stefan Langerman, Jelani Nelson, Vincent Yeung	Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane.	CCCG	2005	DBLP BibTeX RDF
1	Valentin Polishchuk, Joseph S. B. Mitchell	k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane.	CCCG	2005	DBLP BibTeX RDF
1	Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood	The Distance Geometry of Deep Rhythms and Scales.	CCCG	2005	DBLP BibTeX RDF
1	Stefan Schirra	Feasibility of the Exact Geometric Computation Paradigm for Largest Empty Anchored Cylinder Computation in the Plane.	CCCG	2005	DBLP BibTeX RDF
1	Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi	Computing the Widest Empty Boomerang.	CCCG	2005	DBLP BibTeX RDF
1	André Schulz 0001	New results on Pseudo-triangulations with low vertex degree.	CCCG	2005	DBLP BibTeX RDF
1	Eric Y. Chen, Timothy M. Chan	Space-Efficient Algorithms for Klee's Measure Problem.	CCCG	2005	DBLP BibTeX RDF
1	George S.-C. Kao, Thomas Fevens, Jaroslav Opatrny	Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks.	CCCG	2005	DBLP BibTeX RDF
1	Jean Cardinal, Sébastien Collette, Stefan Langerman	Region Counting Distances and Region Counting Circles.	CCCG	2005	DBLP BibTeX RDF
1	Gill Barequet, Yuval Scharf	The Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex Polygon.	CCCG	2005	DBLP BibTeX RDF
1	Paz Carmi, Matthew J. Katz	Minimum-Cost Load-Balancing Partitions.	CCCG	2005	DBLP BibTeX RDF
1	Iris Ashkenazi, Boaz Ben-Moshe, Jihad El-Sana	Approximating Radio Maps.	CCCG	2005	DBLP BibTeX RDF
1	Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara	Small weak epsilon nets.	CCCG	2005	DBLP BibTeX RDF
1	Csaba D. Tóth, Diane L. Souvaine	A vertex-face assignment for plane graphs.	CCCG	2005	DBLP BibTeX RDF
1	Valentin Polishchuk, Joseph S. B. Mitchell	Touring Convex Bodies - A Conic Programming Solution.	CCCG	2005	DBLP BibTeX RDF
1	Sándor P. Fekete, Michael Kaufmann 0001, Alexander Kröller, Katharina Anna Lehmann	A New Approach for Boundary Recognition in Geometric Sensor Networks.	CCCG	2005	DBLP BibTeX RDF
1	John Fischer, Sariel Har-Peled	Dynamic Well-Separated Pair Decomposition Made Easy.	CCCG	2005	DBLP BibTeX RDF
1	Sasanka Roy, Subhasis Bhattacharjee, Sandip Das 0001, Subhas C. Nandy	A Fast Algorithm for Point Labeling Problem.	CCCG	2005	DBLP BibTeX RDF
1	Ovidiu Daescu, Jun Luo 0008, David M. Mount	Proximity Problems on Line Segments Spanned by Points.	CCCG	2005	DBLP BibTeX RDF
1	Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath	Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint.	CCCG	2005	DBLP BibTeX RDF
1	Therese C. Biedl, Burkay Genç	Complexity of Octagonal and Rectangular Cartograms.	CCCG	2005	DBLP BibTeX RDF
1	Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang	An Experimental Assessment of the 2D Visibility Complex.	CCCG	2005	DBLP BibTeX RDF
1	Lilian Buzer	Solving online feasibility problem in constant amortized time per update.	CCCG	2005	DBLP BibTeX RDF
1	Bradford G. Nickerson, Qingxiu Shi	Approximate Orthogonal Range Search using Patricia Tries.	CCCG	2005	DBLP BibTeX RDF
1	Theocharis Malamatos	Lower bounds for expected-case planar point location.	CCCG	2005	DBLP BibTeX RDF
1	Pankaj K. Agarwal, Mark de Berg, Jie Gao 0001, Leonidas J. Guibas, Sariel Har-Peled	Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points.	CCCG	2005	DBLP BibTeX RDF
1	Carla Binucci, Walter Didimo	Experiments on Area Compaction Algorithms for Orthogonal Drawings.	CCCG	2005	DBLP BibTeX RDF
1	Wm. Randolph Franklin	Nearest Point Query on 184M Points in E3 with a Uniform Grid.	CCCG	2005	DBLP BibTeX RDF
1	Rabiul Islam, Nahid Afroz, Subir Bandyopadhyay, Bhabani P. Sinha	Computational Geometry on Optical Multi-Trees (OMULT) Computer System.	CCCG	2005	DBLP BibTeX RDF

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