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