Conferences in DBLP
Kumar Gaurav Bijay , Antoine Vigneron A practical approach to approximating diameter of point-set in low dimensions. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:3-6 [Conf ] Bradford G. Nickerson , Qingxiu Shi Approximate Orthogonal Range Search using Patricia Tries. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:7-10 [Conf ] Daya Ram Gaur , Ramesh Krishnamurti Faster approximation algorithms for scheduling tasks with a choice of start times. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:11-14 [Conf ] Timothy M. Chan , Abdullah-Al Mahmood Approximating the piercing number for unit-height rectangles. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:15-18 [Conf ] Peyman Afshani , Timothy M. Chan Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:19-22 [Conf ] Lilian Buzer The min-# problem, a hybrid error criterion for near linear time performance. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:23-26 [Conf ] Eric Y. Chen , Timothy M. Chan Space-Efficient Algorithms for Klee's Measure Problem. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:27-30 [Conf ] Gill Barequet , Jonathan Naor Large k-D Simplices in the d-Dimensional Cube. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:31-34 [Conf ] Craig Falls , Yuanxin Liu , Jack Snoeyink , Diane L. Souvaine Testing Shortcuts to Maintain Simplicity in Subdivision Simplification. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:35-38 [Conf ] Andreas Spillner Optimal convex partitions of point sets with few inner points. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:39-42 [Conf ] Pankaj K. Agarwal , Mark de Berg , Jie Gao , Leonidas J. Guibas , Sariel Har-Peled Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:43-46 [Conf ] Stephane Durocher , David G. Kirkpatrick The Projection Median of a Set of Points in R2 . [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:47-51 [Conf ] Boris Aronov , Franz Aurenhammer , Ferran Hurtado , Stefan Langerman , David Rappaport , Shakhar Smorodinsky , Carlos Seara Small weak epsilon nets. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:52-56 [Conf ] Jonathan Lenchner , Hervé Brönnimann Observations and Computations in Sylvester-Gallai Theory. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:57-60 [Conf ] Timothy Abbott , Erik D. Demaine , Martin L. Demaine , Daniel Kane , Stefan Langerman , Jelani Nelson , Vincent Yeung Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:61-64 [Conf ] Paz Carmi , Matthew J. Katz Minimum-Cost Load-Balancing Partitions. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:65-67 [Conf ] Sergio Cabello , José Miguel Díaz-Báñez , Stefan Langerman , Carlos Seara , Inmaculada Ventura Reverse facility location problems. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:68-71 [Conf ] Iris Ashkenazi , Boaz Ben-Moshe , Jihad El-Sana Approximating Radio Maps. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:72-75 [Conf ] Robert Benkoczi , Binay K. Bhattacharya , Sandip Das , Jeff Sember Collection depot location problem in the plane. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:76-79 [Conf ] Boaz Ben-Moshe , Binay K. Bhattacharya , Qiaosheng Shi Computing the Widest Empty Boomerang. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:80-83 [Conf ] Sándor P. Fekete , Michael Kaufmann , Alexander Kröller , Katharina Anna Lehmann A New Approach for Boundary Recognition in Geometric Sensor Networks. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:84-87 [Conf ] George Kao , Thomas Fevens , Jaroslav Opatrny Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:88-91 [Conf ] Jean Cardinal , Martine Labbé , Stefan Langerman , Belén Palop Pricing of Geometric Transportation Networks. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:92-96 [Conf ] Robert L. Scot Drysdale , Clifford Stein , David P. Wagner An O(n5/2 log n) Algorithm for the Rectilinear Minimum Link-Distance Problem. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:97-100 [Conf ] Valentin Polishchuk , Joseph S. B. Mitchell k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:101-104 [Conf ] Therese C. Biedl , Franz-Josef Brandenburg Drawing planar bipartite graphs with small area. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:105-108 [Conf ] Therese C. Biedl , Anna Lubiw , Michael J. Spriggs Morphing Polyhedra Preserving Face Normals: A Counterexample. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:109-112 [Conf ] Carla Binucci , Walter Didimo Experiments on Area Compaction Algorithms for Orthogonal Drawings. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:113-116 [Conf ] Therese C. Biedl , Burkay Genc Complexity of Octagonal and Rectangular Cartograms. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:117-120 [Conf ] Stirling Chow , Frank Ruskey Area-Proportional Drawings of Intersecting Families of Simple Closed Curves. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:121-124 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:126-129 [Conf ] André Schulz New results on Pseudo-triangulations with low vertex degree. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:130-133 [Conf ] Luca Castelli Aleardi , Olivier Devillers , Gilles Schaeffer Dynamic updates of succinct triangulations. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:134-137 [Conf ] Csaba D. Tóth , Diane L. Souvaine A vertex-face assignment for plane graphs. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:138-141 [Conf ] Raquel Viaña Compactly Encoding and Decoding the Connectivity of a Plane Graph in Linear Time. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:142-145 [Conf ] N. Madhusudhanan , Prosenjit Gupta , Abhijit Mitra Efficient Algorithms for Range Queries in Protein Sequence Analysis. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:146-149 [Conf ] Rabiul Islam , Nahid Afroz , Subir Bandyopadhyay , Bhabani P. Sinha Computational Geometry on Optical Multi-Trees (OMULT) Computer System. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:150-154 [Conf ] Sasanka Roy , Subhasis Bhattacharjee , Sandip Das , Subhas C. Nandy A Fast Algorithm for Point Labeling Problem. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:155-158 [Conf ] Sherif Ghali , Chris Smith Computing the Boundary of a Class of Labeled-Leaf BSP Solids. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:159-162 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:163-166 [Conf ] Subhashis Majumder , Bhargab B. Bhattacharya Density or Discrepancy: A VLSI Designer's Dilemma in Hot Spot Analysis. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:167-170 [Conf ] Stefan Schirra Feasibility of the Exact Geometric Computation Paradigm for Largest Empty Anchored Cylinder Computation in the Plane. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:171-174 [Conf ] Gill Barequet , Yuval Scharf The Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex Polygon. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:175-178 [Conf ] Prosenjit Bose , Jason Morrison Translating a Star over a Point Set. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:179-182 [Conf ] Ramaswamy Chandrasekaran , Ovidiu Daescu , Jun Luo Cutting Out Polygons. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:183-186 [Conf ] Therese C. Biedl The complexity of domino tiling. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:187-190 [Conf ] Theocharis Malamatos Lower bounds for expected-case planar point location. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:191-194 [Conf ] Maike Buchin , Joachim Giesen Minimizing the Total Absolute Gaussian Curvature in a Terrain is Hard. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:195-198 [Conf ] Therese C. Biedl , Joseph Douglas Horton , Alejandro López-Ortiz Cross-Stitching Using Little Thread. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:199-202 [Conf ] Chris Worman , Boting Yang On the Computation and Chromatic Number of Colored Domino Tilings. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:203-206 [Conf ] James Factor Designing Modern Linkages to Trace Bezier Curves. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:207-210 [Conf ] Mirela Damian , Robin Y. Flatland , Joseph O'Rourke Unfolding Manhattan Towers. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:211-214 [Conf ] Dominique Michelucci , Sebti Foufou , Loïc Lamarque , David Ménegaux Bernstein based arithmetic featuring de Casteljau. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:215-218 [Conf ] Audrey Lee , Ileana Streinu , Louis Theran Finding and Maintaining Rigid Components. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:219-222 [Conf ] Jack Snoeyink , Ileana Streinu Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:223-226 [Conf ] Ovidiu Daescu , Jun Luo , David M. Mount Proximity Problems on Line Segments Spanned by Points. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:227-231 [Conf ] Kathryn Duffy , Chris McAloney , Henk Meijer , David Rappaport Closest Segments. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:232-234 [Conf ] John Fischer , Sariel Har-Peled Dynamic Well-Separated Pair Decomposition Made Easy. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:235-238 [Conf ] Wm. Randolph Franklin Nearest Point Query on 184M Points in E3 with a Uniform Grid. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:239-242 [Conf ] Boaz Ben-Moshe , Binay K. Bhattacharya , Qiaosheng Shi Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:243-246 [Conf ] Amr Elmasry , Khaled M. Elbassioni Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:248-251 [Conf ] Nejib Zaguia , Guy-Vincent Jourdan , Mustafa Alhashem On the Pagenumber of Bipartite Orders. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:252-255 [Conf ] Christophe Weibel , Komei Fukuda Computing faces up to k dimensions of a Minkowski Sum of Polytopes. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:256-259 [Conf ] Michael Burr , Alexandra Lauric , Katelyn Mann Searching for the Center of an Ellipse. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:260-263 [Conf ] Jack Snoeyink Maximum Independent Set for Intervals by Divide-Prune-and-Conquer. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:264-265 [Conf ] Jean-Daniel Boissonnat , Camille Wormser , Mariette Yvinec Anisotropic Diagrams: Labelle Shewchuk approach revisited. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:266-269 [Conf ] Kevin Buchin , Joachim Giesen Flow Complex: General Structure and Algorithm. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:270-273 [Conf ] Shin-ichi Tanigawa , Naoki Katoh Finding a triangular mesh with a constant number of different edge lengths. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:274-277 [Conf ] Jean Cardinal , Sébastien Collette , Stefan Langerman Region Counting Distances and Region Counting Circles. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:278-281 [Conf ] Démian Nave , Nikos Chrisochoides Boundary Refinement in Delaunay Mesh Generation Using Arbitrarily Ordered Vertex Insertion. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:282-285 [Conf ] Lilian Buzer Solving online feasibility problem in constant amortized time per update. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:286-289 [Conf ] Valentin Polishchuk , Joseph S. B. Mitchell Touring Convex Bodies - A Conic Programming Solution. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:290-293 [Conf ] Luc Habert Computing bitangents for ellipses. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:294-297 [Conf ] Hazel Everett , Sylvain Lazard , Sylvain Petitjean , Linqiao Zhang An Experimental Assessment of the 2D Visibility Complex. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:298-301 [Conf ] Olivier Devillers , Vida Dujmovic , Hazel Everett , Samuel Hornus , Sue Whitesides , Steve Wismath Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:302-305 [Conf ]