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