Discrete and computational geometry

Discrete and Computational Geometry

Volumn , Issue , 2011, Pages

  Devadoss, Satyan L ^a   O'Rourke, Joseph ^b  

^a WILLIAMS COLLEGE   (United States)

^b SMITH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 83455218096     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (40)

1. Joseph O'Rourke. Computational Geometry in C. Cambridge University Press, 2nd edition, 1998.
2. Richard Stanley. Enumerative Combinatorics, Volume I and II. Cambridge University Press, 1997, 1999.
3. Joseph O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, 1987.
4. Greg Frederickson. Dissections: Plane & Fancy. Cambridge University Press, 1997.
5. Vladimir Boltyanskii, Hilbert's Third Problem. V. H. Winston & Sons, 1978.
6. Alexander Barvinok. A Course in Convexity. American Mathematical Society, 2002.
7. Joseph O'Rourke. Computational Geometry in C. Cambridge University Press, 2nd edition, 1998.
8. Franco Preparata and Michael Shamos. Computational Geometry: An Introduction. Springer-Verlag, 3rd edition, 1990.
9. Stefan Schirra. Robustness and Precision Issues in Geometric Computation. In Jörg-Rüdiger Sack and Jorge Urrutia, editors, Handbook of Computational Geometry, chapter 14, pages 597-632. Elsevier, 2000.
10. Lutz Kettner and Stefan Näher. Two Computational Geometry Libraries: LEDA and CGAL. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 65, pages 1435-1463. CRC Press LLC, 2nd edition, 2004.
11. Raimund Seidel. Convex hull computations. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 22, pages 495-512. CRC Press LLC, 2nd edition, 2004.
12. Marshall Bern. Triangulations. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 25, pages 563-582. CRC Press LLC, 2nd edition, 2004.
13. Herbert Edelsbrunner. Geometry and Topology for Mesh Generation. Cambridge University Press, 2001.
14. Charles Lawson. Transforming triangulations. Discrete Mathematics, Volume 3, pages 365-372, 1972.
15. Daniel Sleator, Robert Tarjan, and William Thurston. Rotational distance, triangulations, and hyperbolic geometry. Journal of the American Mathematical Society, Volume 1, pages 647-681, 1988.
16. Jonathan Shewchuck. TRIANGLE: A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator. http://www.cs.cmu.edu/~quake/triangle.html
17. Jon McCammond. Noncrossing partitions in surprising locations. American Mathematical Monthly, Volume 113, pages 598-610, 2006.
18. Atsuyuki Okabe, Barry Boots, and Kokichi Sugihara. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, 2nd edition, 2000.
19. Steve Fortune. Voronoi diagrams and Delaunay triangulations. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 22, pages 513-528. CRC Press LLC, 2nd edition, 2004.
20. Franz Aurenhammer and Rolf Klein. Voronoi diagrams. In Jörg-Rüdiger Sack and Jorge Urrutia, editors, Handbook of Computational Geometry, chapter 5, pages 201-290, Elsevier, 2000.
21. Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, 3rd edition, 2008.
22. Herbert Edelsbrunner and Raimund Seidel. Voronoi diagrams and arrangements. Discrete and Computational Geometry, Volume 1, pages 25-44, 1986.
23. Francis Chin, Jack Snoeyink, and Cao An Wang. Finding the medial axis of a simple polygon in linear time. Discrete and Computational Geometry, Volume 21, pages 405-420, 1999.
24. Jeff Erickson and David Eppstein. Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions. Discrete and Computational Geometry, Volume 22, pages 569-592, 1999.
25. Ron Wein. 2D Minkowski sums, Chapter 22 of The CGAL Manual. http://www.cgal.org/Manual/.
26. Kai-Seng Chou and Xi-Ping Zhu. The Curve Shortening Problem. Chapman & Hall, 2001.
27. John Morgan and Gang Tian. Ricci Flow and the Poincaré conjecture, Clay Mathematics Monographs, Volume 3. American Mathematical Society, 2007.
28. Tamal Dey. Curve and Surface Reconstruction: Algorithms with Mathematical Analysis. Cambridge University Press, 2006.
29. Peter Cromwell. Polyhedra. Cambridge University Press, 1997.
30. H. S. M. Coxeter. Regular Polytopes. Dover, 2nd edition, 1973.
31. Branko Grünbaum. Convex Polytopes. Springer-Verlag, 2nd edition, 2003.
32. Martin Aigner and Günter Ziegler. Proofs from THE BOOK. Springer- Verlag, 4th edition, 2009.
33. Alexander Alexandrov. Convex Polyhedra. Springer-Verlag, 2005.
34. Erik Demaine and Joseph O'Rourke. Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, 2007.
35. Erik Demaine and Joseph O'Rourke. Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, 2007.
36. Joseph O'Rourke. Computational Geometry in C. Cambridge University Press, 2nd edition, 1998.
37. Colin Adams. The Knot Book. American Mathematical Society, 2004.
38. Don Shimamoto and Catherine Vanderwaart. Spaces of polygons in the plane and Morse theory. American Mathematical Monthly, Volume 112, pages 289-310, 2005.
39. Steven LaValle. Planning Algorithms. Cambridge University Press, 2006.
40. Satyan Devadoss. Combinatorial equivalence of moduli spaces. Notices of the American Mathematical Society, Volume 51, pages 620-628, 2004.