On realistic terrains

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 177-186

  Moet, Esther ^a   Van Kreveld, Marc ^a   Van Der Stappen, A Frank ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Polyhedral terrains; Realistic input models; Shortest paths; Visibility maps; Voronoi diagrams

Indexed keywords

COMPUTATIONAL COMPLEXITY; VISIBILITY;

POLYHEDRAL TERRAINS; REALISTIC INPUT MODELS; SHORTEST PATHS; VISIBILITY MAPS; VORONOI DIAGRAMS;

LANDFORMS;

EID: 33748065324     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137856.1137885     Document Type: Conference Paper

References (21)

1. H. Alt, R. Fleischer, M. Kaufmann, K. Mehlhorn, S. Näher, S. Schirra, and C. Uhrig. Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. Algorithmica, 8:391-406, 1992.
2. B. Aronov, A. Efrat, V. Koltun, and M. Sharir. On the union of κ-round objects in three and four dimensions. In Proc. 20st Annu. ACM Sympos. Comput. Geom., pages 383-390, 2004.
3. B. Aronov and J. O'Rourke. Nonoverlap of the star unfolding. Discrete Comput. Geom., 8:219-250, 1992.
4. J. Chen and Y. Han. Shortest paths on a polyhedron, Internat. J. Comput. Geom. Appl., 6(2):127-144, 1996.
5. M. de Berg. Linear size binary space partitions for uncluttered scenes. Algorithmica, 28:353-366, 2000.
6. M. de Berg. Vertical ray shooting for fat objects. In Proc. 21st Annu. ACM Sympos. Comput. Geom., pages 288-295, 2005.
7. M. de Berg, M. J. Katz, M. Overmars, A. F. van der Stappen, and J. Vleugels. Models and motion planning. Comput. Geom. Theory Appl., 23:53-68, 2002.
8. M. de Berg, M. J. Katz, A. F. van der Stappen, and J. Vleugels. Realistic input models for geometric algorithms. Algorithmica, 34:81-97, 2002.
9. A. Efrat. The complexity of the union of (α, β)-covered objects. SIAM J. Comput., 34:775-787, 2005.
10. J. Erickson. Local polyhedra and geometric graphs. Comput. Geom. Theory Appl, 31:101-125, 2005.
11. S. Kapoor. Efficient computation of geodesic shortest paths. In Proc. 31st Annu. ACM Sympos. Theory of Computing, pages 770-779, 1999.
12. M. J. Katz, M. H. Overmars, and M. Sharir. Efficient hidden surface removal for objects with small union size. Comput. Geom. Theory Appl., 2:223-234, 1992.
13. J. Matoušek, J. Pach, M. Sharir, S. Sifrony, and E. Welzl. Fat triangles determine linearly many holes. SIAM J. Comput, 23:154-169, 1994.
14. M. McKenna. Worst-case optimal hidden-surface removal. ACM Trans. Graph., 6:19-28, 1987.
15. J. S. B. Mitchell, D. M. Mount, and C. H. Papadimitriou. The discrete geodesic problem. SIAM J. Comput., 16:647-668, 1987.
16. J. S. B. Mitchell, D. M. Mount, and S. Suri. Query-sensitive ray shooting. Internat. J. Comput. Geom. Appl., 7(4):317-347, Aug. 1997.
17. M. H. Overmars and A. F. van der Stappen. Range searching and point location among fat objects. J. Algorithms, 21:629-656, 1996.
18. O. Schwarzkopf and J. Vleugels. Range searching in low-density environments. Inform. Process. Lett., 60:121-127, 1996.
19. A. F. van der Stappen, M. H. Overmars, M. de Berg, and J. Vleugels. Motion planning in environments with low obstacle density. Discrete Comput. Geom., 20(4):561-587, 1998.
20. M. van Kreveld. On fat partitioning, fat covering, and the union size of polygons. Comput. Geom. Theory Appl., 9(4):197-210, 1998.
21. J. Vleugels. On Fatness and Fitness - Realistic Input Models for Geometric Algorithms. Ph.D. thesis, Dept. Comput. Sci., Univ. Utrecht, Utrecht, The Netherlands, 1997.