Computational geometry column 42

International Journal of Computational Geometry and Applications

Volumn 11, Issue 5, 2001, Pages 573-582

  Mitchell, Joseph S B ^a   O'Rourke, Joseph ^b  

^a STONY BROOK UNIVERSITY   (United States)

^b SMITH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035640792     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195901000651     Document Type: Article

References (73)

1. N. Amenta, S. Choi, T. K. Dey, and N. Leekha. A simple algorithm for homeomorphic surface reconstruction. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 213-222, 2000.
2. P. K. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete Comput. Geom., 6(5):407-422, 1991.
3. P. K. Agarwal. Ray shooting and other applications of spanning trees with low stabbing number. SIAM J. Comput., 21:540-570, 1992.
4. G. Albers, L. J. Guibas, J. S. B. Mitchell, and T. Roos. Voronoi diagrams of moving points. Internat. J. Comput. Geom. Appl., 8:365-380, 1998.
5. N. M. Amato, M. T. Goodrich, and E. A. Ramos. Linear-time triangulation of a simple polygon made easier via randomization. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 201-212, 2000.
6. T. Auer and M. Held. Heuristics for the generation of random polygons. In Proc. 8th Canad. Conf. Comput. Geom., pages 38-43, 1996.
7. E. M. Arkin, M. Held, J. S. B. Mitchell, and S. S. Skiena. Hamiltonian triangulations for fast rendering. Visual Comput., 12(9):429-444, 1996.
8. S. Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM, 45(5):753-782, 1998.
9. P. K. Agarwal and S. Suri. Surface approximation and geometric partitions. SIAM J. Comput., 27:1016-1035, 1998.
10. P. K. Agarwal and M. Sharir. Pipes, cigars, and kreplach: The union of Minkowski sums in three dimensions. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 143-153, 1999.
11. P. K. Agarwal and M. Sharir. Davenport-Schinzel sequences and their geometric applications. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 1-47. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
12. P. K. Agarwal and M. Sharir. Pipes, cigars, and kreplach: The union of Minkowski sums in three dimensions. Discrete Comput. Geom., 24(4):645-685, 2000.
13. P. K. Agarwal and K. R. Varadarajan. Approximating monotone polygonal curves using the uniform metric. Discrete Comput. Geom., 23, 2000. to appear.
14. M. Bern, E. D. Demaine, D. Eppstein, E. Kuo, A. Mantler, and J. Snoeyink. Ununfoldable polyhedra with convex faces. Comput. Geom. Theory Appl., 2001.
15. M. Bern, D. Eppstein, P. K. Agarwal, N. Amenta, P. Chew, T. Dey, D. P. Dobkin, H. Edelsbrunner, C. Grimm, L. J. Guibas, J. Harer, J. Hass, A. Hicks, C. K. Johnson, G. Lerman, D. Letscher, P. Plassmann, E. Sedgwick, J. Snoeyink, J. Weeks, C. Yap, and D. Zorin. Emerging challenges in computational topology, 1999. Report on an NSF Workshop on Computational Topology, June 11-12, Miami Beach, FL.
16. H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom., 14:263-279, 1995.
17. G. S. Brodal and R. Jacob. Dynamic planar convex hull with optimal query time and O(log n · log log n) update time. In Proc. 7th Scand. Workshop Alg. Theory, volume 1851 of Lecture Notes in Computer Science, pages 57-70. Springer-Verlag, 2000.
18. M. Bern and A. Sahai. Pushing disks together - The continuous-motion case. Discrete Comput. Geom., 20:499-514, 1998.
19. J.-D. Boissonnat, M. Sharir, B. Tagansky, and M. Yvinec. Voronoi diagrams in higher dimensions under certain polyhedral distance functions. Discrete Comput. Geom., 19(4):473-484, 1998.
20. V. Capoyleas. On the area of the intersection of disks in the plane. Comput. Geom. Theory Appl., 6:393-396, 1996.
21. W. S. Chan and F. Chin. Approximation of polygonal curves with minimum number of line segments or minimum error. Internat. J. Comput. Geom. Appl., 6:59-77, 1996.
22. B. Chazelle. Tight bounds on the stabbing number of spanning trees in Euclidean space. Report CS-TR-155-88, Dept. Comput. Sci., Princeton Univ., Princeton, NJ, 1988.
23. B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6(5):485-524, 1991.
24. T. M. Chan. Output-sensitive results on convex hulls, extreme points, and related problems. Discrete Comput. Geom., 16:369-387, 1996.
25. B. Chazelle. A faster deterministic algorithm for minimum spanning trees. In Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci., page To appear, 1997.
26. T. M. Chan. Dynamic planar convex hull operations in near-logarithmic amortized time. In Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci., pages 92-99, 1999.
27. 1 Voronoi diagram of moving points. Comput. Geom. Theory Appl., 7:73-80, 1997.
28. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM, 42:67-90, 1995.
29. S.-W. Cheng and K.-H. Lee. Quadtree decomposition, Steiner triangulation, and ray shooting. In ISAAC: 9th Internat. Sympos. Algorithms Computation, pages 367-376, 1998.
30. T. K. Dey. Improved bounds on planar k-sets and related problems. Discrete Comput. Geom., 19:373-382, 1998.
31. G. Das and M. T. Goodrich. On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees. Comput. Geom. Theory Appl., 8:123-137, 1997.
32. M. T. Dickerson, S. A. McElfresh, and M. H. Montague. New algorithms and empirical findings on minimum weight triangulation heuristics. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 238-247, 1995.
33. M. E. Dyer. Linear time algorithms for two- and three-variable linear programs. SIAM J. Comput., 13:31-45, 1984.
34. V. Estivill-Castro, J. O'Rourke, J. Urrutia, and D. Xu. Illumination of polygons with vertex floodlights. Inform. Process. Lett., 56:9-13, 1995.
35. D. Eppstein. Approximating the minimum weight Steiner triangulation. Discrete Comput. Geom., 11:163-191, 1994.
36. D. Eppstein. Linear complexity hexahedral mesh generation. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 58-67, 1996.
37. H. Edelsbrunner, F. P. Preparata, and D. B. West. Tetrahedrizing point sets in three dimensions. J. Symbolic Comput., 10(3-4):335-347, 1990.
38. A. Efrat and M. Sharir. On the complexity of the union of fat objects in the plane. Discrete Comput. Geom., 23:171-189, 2000.
39. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979.
40. D. Grigoriev, M. Karpinski, F. M. auf der Heide, and R. Smolensky. A lower bound for randomized algebraic decision trees. In Proc. 28th ACM Sympos. Theory Comput., pages 612-619, 1996.
41. 2) problems in computational geometry. Comput. Geom. Theory Appl., 5:165-185, 1995.
42. J. Hershberger and J. Snoeyink. An O(n log n) implementation of the Douglas-Peucker algorithm for line simplification. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 383-384, 1994.
43. J. Hershberger and S. Suri. An optimal algorithm for Euclidean shortest paths in the plane. SIAM J. Comput., 28(6):2215-2256, 1999.
44. B. Joe. Construction of three-dimensional Delaunay triangulations using local transformations. Comput. Aided Geom. Design, 8(2):123-142, May 1991.
45. N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4:373-395, 1984.
46. L. G. Khachiyan. Polynomial algorithm in linear programming. U.S.S.R. Comput. Math. and Math. Phys., 20:53-72, 1980.
47. S. Kapoor, S. N. Maheshwari, and J. S. B. Mitchell. An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane. Discrete Comput. Geom., 18:377-383, 1997.
48. V. Koltun. Almost tight upper bounds for vertical decompositions in four dimensions. In Proc. 42nd Sympos. Foundations Comput. Sci., 2001.
49. C. Levcopoulos and D. Krznaric. Quasi-greedy triangulations approximating the minimum weight triangulation. In Proc. 7th ACM-SIAM Sympos. Discrete Algorithms, pages 392-401, 1996.
50. L. Lovász, J. Pach, and M. Szegedy. On Conway's thrackle conjecture. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 147-151, 1995.
51. N. Megiddo. Linear programming in linear time when the dimension is fixed. J. ACM, 31:114-127, 1984.
52. S. A. Mitchell. A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume. In Proc. 13th Sympos. Theoret. Aspects Comput. Sci., volume 1046 of Lecture Notes Comput. Sci., pages 465-476. Springer-Verlag, 1996.
53. J. S. B. Mitchell. Geometric shortest paths and network optimization. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 633-701. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
54. J. S. B. Mitchell, G. Rote, and G. Woeginger. Minimum-link paths among obstacles in the plane. Algorithmica, 8:431-459, 1992.
55. J. S. B. Mitchell and S. Suri. Separation and approximation of polyhedral objects. Comput. Geom. Theory Appl., 5:95-114, 1995.
56. J. Matoušek, M. Sharir, and E. Welzl. A subexponential bound for linear program-ming. Algorithmica, 16:498-516, 1996.
57. J. O'Rourke. Computational geometry column 18. Internat. J. Comput. Geom. Appl., 3(1):107-113, 1993. Also in SIGACT News 24:1 (1993), 20-25.
58. J. O'Rourke. Computational geometry column 18. Internat. J. Comput. Geom. Appl., 3(1):107-113, 1993. Also in SIGACT News 24:1 (1993), 20-25.
59. J. O'Rourke. Folding and unfolding in computational geometry. In Proc. Japan Conf. Discrete Comput. Geom. '98, volume 1763 of Lecture Notes Comput. Sci., pages 258-266. Springer-Verlag, 2000.
60. J. O'Rourke and I. Streinu. Vertex-edge pseudo-visibility graphs: Characterization and recognition. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 119-128, 1997.
61. J. Pach, I. Safruit, and M. Sharir. The union of congruent cubes in three dimensions. In Proc. 17th ACM Sympos. Comput. Geom., pages 19-28, 2001.
62. M. S. Paterson and F. F. Yao. Efficient binary space partitions for hidden-surface removal and solid modeling. Discrete Comput. Geom., 5:485-503, 1990.
63. M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995.
64. R. Seidel. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. Theory Appl., 1(1):51-64, 1991.
65. M. Sharir. Almost tight upper bounds for lower envelopes in higher dimensions. Discrete Comput. Geom., 12:327-345, 1994.
66. G. C. Shephard. Convex polytopes with convex nets. Math. Proc. Camb. Phil. Soc., 78:389-403, 1975.
67. J. Snoeyink. Point location. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 30, pages 559-574. CRC Press LLC, Boca Raton, FL, 1997.
68. G. Tóth. Point sets with many k-sets. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 37-42, 2000.
69. C. D. Tóth. A note on binary plane partitions. In Proc. 17th ACM Sympos. Comput. Geom., pages 151-156, 2001.
70. J. Urrutia. Art gallery and illumination problems. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 973-1027. North-Holland, 2000.
71. P. M. Vaidya. Geometry helps in matching. SIAM J. Comput., 18:1201-1225, 1989.
72. E. Welzl. Geometric graphs with small stabbing numbers: Combinatorics and applications. In Proc. 9th Internat. Conf. Fund. Comput. Theory, Lecture Notes Comput. Sci., Springer-Verlag, 1993.
73. C. Zhu, G. Sundaram, J. Snoeyink, and J. S. B. Mitchell. Generating random polygons with given vertices. Comput. Geom. Theory Appl., 6:277-290, 1996.