Conferences in DBLP
Rossen Atanassov , Pat Morin , Stefanie Wuhrer Removing Outliers to Minimize Area and Perimeter. [Citation Graph (0, 0)][DBLP ] Conf ] Junqiang Zhou , Simeon C. Ntafos Two-Guard Art Gallery Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Jason Morrison Optimal Polygon Placement. [Citation Graph (0, 0)][DBLP ] Conf ] Maryam Babazadeh , Hamid Zarrabi-Zadeh Small Weak Epsilon-Nets in Three Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Mustaq Ahmed , Anna Lubiw Shortest Descending Paths through Given Faces. [Citation Graph (0, 0)][DBLP ] Conf ] Dominique Michelucci , Sebti Foufou , Loïc Lamarque , David Ménegaux Another Paradigm for Geometric Constraints Solving. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Pat Morin , Michiel H. M. Smid , Stefanie Wuhrer Rotationally Monotone Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Sada Narayanappa , Petr Vojtechovský An Improved Approximation Factor For The Unit Disk Covering Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Valentin Polishchuk , Esther M. Arkin , Joseph S. B. Mitchell Hamiltonian Cycles in Triangular Grids. [Citation Graph (0, 0)][DBLP ] Conf ] Bradford G. Nickerson , Qingxiu Shi K-Nearest Neighbor Search using the Pyramid Technique. [Citation Graph (0, 0)][DBLP ] Conf ] Bradford G. Nickerson , Qingxiu Shi The PKD-tree for Orthogonal d-Dimensional Range Search. [Citation Graph (0, 0)][DBLP ] Conf ] Ryuhei Uehara , Sachio Teramoto The Complexity of a Pop-Up Book. [Citation Graph (0, 0)][DBLP ] Conf ] Nadia Benbernou , Joseph O'Rourke On the Maximum Span of Fixed-Angle Chains. [Citation Graph (0, 0)][DBLP ] Conf ] Abdelkrim Mebarki , Luca Castelli Aleardi , Olivier Devillers 2D Triangulation Representation Using Stable Catalogs. [Citation Graph (0, 0)][DBLP ] Conf ] Hamid Zarrabi-Zadeh , Timothy M. Chan A Simple Streaming Algorithm for Minimum Enclosing Balls. [Citation Graph (0, 0)][DBLP ] Conf ] Mirela Damian , Erik D. Demaine , Martin L. Demaine , Vida Dujmovic , Dania El-Khechen , Robin Y. Flatland , John Iacono , Stefan Langerman , Henk Meijer , Suneeta Ramaswami , Diane L. Souvaine , Perouz Taslakian , Godfried T. Toussaint Curves in the Sand: Algorithmic Drawing. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , David Bremner , Diane L. Souvaine Computing the Tool Path of an Externally Monotone Polygon in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Tusch , Stefan Schirra Experimental Comparison of the Cost of Approximate and Exact Convex Hull Computation in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] David M. Mount Invited Lecture: On Approximate Range Searching - or - Get in Shape; Round is a Good Choice. [Citation Graph (0, 0)][DBLP ] Conf ] Csaba D. Tóth , Michael Hoffmann Spanning trees across axis-parallel segments. [Citation Graph (0, 0)][DBLP ] Conf ] Hüseyin Akcan , Hervé Brönnimann , Robert Marini Practical and Efficient Geometric Epsilon-Approximations. [Citation Graph (0, 0)][DBLP ] Conf ] Wei Li , Karen Daniels , Konstantin A. Rybnikov A Study of Conway's Thrackle Conjecture. [Citation Graph (0, 0)][DBLP ] Conf ] James A. King Realization of Degree 10 Minimum Spanning Trees in 3-Space. [Citation Graph (0, 0)][DBLP ] Conf ] Asish Mukhopadhyay , Robert L. Scot Drysdale An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points. [Citation Graph (0, 0)][DBLP ] Conf ] Yakov Nekrich A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries. [Citation Graph (0, 0)][DBLP ] Conf ] R. Sharathkumar , Prosenjit Gupta Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts. [Citation Graph (0, 0)][DBLP ] Conf ] Rafa Absar , Sue Whitesides On Computing Shortest External Watchman Routes for Convex Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Tsunehiko Kameda , John Z. Zhang , Masafumi Yamashita Characterization of Polygons Searchable by a Boundary 1-Searcher. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Joseph O'Rourke Open Problems: Open Problems from CCCG 2005. [Citation Graph (0, 0)][DBLP ] Conf ] Jeff M. Phillips , Pankaj K. Agarwal On Bipartite Matching under the RMS Distance. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Blaise Gassend , Joseph O'Rourke , Godfried T. Toussaint Polygons Flip Finitely: Flaws and a Fix. [Citation Graph (0, 0)][DBLP ] Conf ] Gill Barequet , Craig Gotsman , Avishay Sidlesky Polygon Reconstruction from Line Cross-Sections. [Citation Graph (0, 0)][DBLP ] Conf ] Maarten H. van Emden , Belaid Moa Computational Euclid. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine Paul Erdos Memorial Lecture: Linkage Folding: From Erdos to Proteins. [Citation Graph (0, 0)][DBLP ] Conf ] Mirela Ben-Chen , Craig Gotsman , Steven J. Gortler Routing with Guaranteed Delivery on Virtual Coordinates. [Citation Graph (0, 0)][DBLP ] Conf ] Walter Whiteley Invited Lecture: Predicting the Flexibility and Rigidity of Proteins: Geometry, Combinatorics, Conjectures, and Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Nielsen , Richard Nock On the Smallest Enclosing Information Disk. [Citation Graph (0, 0)][DBLP ] Conf ] Brendan Lucier Local Overlaps In Special Unfoldings Of Convex Polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Yurai Núñez Rodríguez , David Rappaport Tight Bounds for Point Recolouring. [Citation Graph (0, 0)][DBLP ] Conf ] Kamrul Islam , Selim G. Akl , Henk Meijer On Planar Path Transformation. [Citation Graph (0, 0)][DBLP ] Conf ] Craig Gotsman , Ian Fischer Computing Depth Contours with Graphics Hardware. [Citation Graph (0, 0)][DBLP ] Conf ] Binay K. Bhattacharya , John Z. Zhang , Qiaosheng Shi , Tsunehiko Kameda An Optimal Solution to Room Search Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Funke , Theocharis Malamatos , Domagoj Matijevic , Nicola Wolpert (Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram. [Citation Graph (0, 0)][DBLP ] Conf ] Kebin Wang , Shang-Hua Teng Geometric Separator for d-Dimensional Ball Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Hazel Everett , Sylvain Lazard , William J. Lenhart , Jeremy Redburn , Linqiao Zhang Predicates for Line Transversals in 3D. [Citation Graph (0, 0)][DBLP ] Conf ] Dania El-Khechen , Thomas Fevens , John Iacono Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large n. [Citation Graph (0, 0)][DBLP ] Conf ] Stephane Durocher , Chris Gray , James A. King Minimizing the Number of Arcs Linking a Permutation of Points in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Jonathan Backer , David Kirkpatrick Bounded-Curvature Path Normalization. [Citation Graph (0, 0)][DBLP ] Conf ] 