Inner-cover of non-convex shapes

International Journal of Shape Modeling

Volumn 9, Issue 2, 2003, Pages 223-238

  Cohen Or, Daniel ^a   Lev Yehudi, Shuly ^a   Karol, Adi ^a   Tal, Ayellet ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Convexity; Cover; Decomposition; Partition; Visibility

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; PROBLEM SOLVING; SET THEORY;

CONVEXITY; POTENTIAL VISIBLE SET (PVS);

COMPUTER GRAPHICS;

EID: 1642536311     PISSN: 02186543     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218654303000139     Document Type: Article

References (27)

1. D. Cohen-Or, Y. Chrysanthou, C. Silva and F. Durand. A Survey of Visibility for Walkthrough Applications. Siggraph 2001 course notes on visibility.
2. D. Cohen-Or, G. Fibich, D. Halperin, and E. Zadicario. Conservative visibility and strong occlusion for viewspace partitioning of densely occluded scenes. Computer Graphics Forum, 17(3): 243-254, 1998.
3. S. Coorg and S. Teller. Real-time occlusion culling for models with large occluders. Symposium on Interactive 3D Graphics, pages 83-90, April 1997.
4. T. Hudson, D. Manocha, J. Cohen, M. Lin, K. Hoff and H. Zhang. Accelerated occlusion culling using shadow frustra. In Proc.13th Annu. ACM Sympos. Comput. Geom., pages 1-10, 1997.
5. H. Zhang, D. Manocha, T. Hudson and K-n.E. Hoff III. Visibility culling using hierarchical occlusion maps. In Turner Whitted, editor, SIGGRAPH 97 Conference Proceedings, Annual Conference Series, pages 77-88. ACM SIGGRAPH, Addison Wesley, August 1997.
6. P. Brunet, I. Navazo, J. Rossignac, and C. Saona-Vásquez. Hoops: 3d curves as conservative occluders for cell-visibility. In A.Chalmers and T.-M.Rhyne, editors, Computer Graphics Forum (Proc.of Eurographics '01), volume 20(3), Manchester, UK, September 2001.
7. R. Germs and F.W. Jansen. Geometric Simplification for Efficient Occlusion Culling in Urban Scenes. WSCG 2001 Conference Proceedings, pages 291-298.
8. V. Koltun, Y. Chrysanthou and D. Cohen-Or. Virtual occluders: An efficient intermediate pvs representation. Rendering Techniques 2000: 11th Eurographics Workshop on Rendering, pages 59-70, June 2000. ISBN 3-211-83535-0.
9. F-A. Law and T-S. Tan. Preprocessing occlusion for real-time selective refinement. In Stephen N. Spencer, editor, Proceedings of the Conference on the 1999 Sym-posium on interactive 3D Graphics, pages 47-54, New York, April 26-28 1999. ACM Press.
10. H. Zhang. Effective Occlusion Culling for the Interactive Display of Arbitrary Models. Ph.D.thesis, Department of Computer Science, UNC-Chapel Hill, 1998.
11. C. Saona-Vazquez, I. Navazo and P. Brunet. The visibility octree.: A data structure for 3d navigation. Computer & Graphics, 23(5):635-644, 1999.
12. B. Chazelle and D. P. Dobkin. Optimal convex decompositions. Computational Geometry, editor G. T. Toussaint, publisher North-Holland, Amsterdam, Netherlands, 1985, 63-133.
13. D.H. Greene. The Decomposition of Polygons into Convex Parts. Computational Geometry, editor Franco P. Preparata 1983, 235-259.
14. S. Hertel and K. Mehlhorn. Fast triangulation of simple polygons. Proc. 4th Internat. Conf. Found. Comput. Theory, Lecture Notes Comput. Sci. 1983, 207-218
15. J. M. Keil Decomposing a polygon into simpler components. SIAM J. Comput. 14, 1985, 799-817.
16. P. Berman and B. DasGupta. Approximating the rectilinear polygon cover problems. Proc. 4th Canad. Conf. Comput. Geom. 1992, 229-235.
17. C. Levcopoulos, J. Gudmundsson. Approximation Algorithms for Covering Polygons with Squares and Similar Problems. RANDOM: International Workshop on Randomization and Approximation Techniques in Computer Science, 1997.
18. C. Andújar, C. Saona-Vásquez, I. Navazo. LOD Visibility Culling and Occluder Synthesis . Computer-Aided Design, Volume 32(13), 773-783.
19. L. Leblanc and P. Poulin. Guaranteed occlusion and visibility in cluster hierarchical radiosity. In Eurographics Workshop on Rendering, pages 89-100, June 2000.
20. J. S. Chang and C. K. Yap. A polynomial solution for potato-peeling and other polygon inclusion and enclosure problems. In 25th Annual Symposium on Foundations of Computer Science, pages 408-416, Singer Island, Florida, 24-26 October 1984.
21. J.C. Culberson and R.A. Reckhow. Covering polygons is hard. Journal of Algorithms, 17(1):2-44, July 1994.
22. J. O'Rourke. Computational Geometry in C. Cambridge University Press, 1st edition, 1994.
23. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997.
24. Computational Geometry Algorithms Library. http://www.cgal.org/
25. E. Flato, D. Halperin, I. Hanniel, O. Nechushtan, and E. Ezra. The Design and Implementation of Planar Maps in CGAL. The ACM Journal of Experimental Algorithmics, volume 5, 2000. Also in LNCS Vol. 1668 (WAE '99), Springer Verlag, pp. 154-168.
26. E. Flato, D. Halperin, I. Hanniel, O. Nechushtan, and E. Ezra. The Design and Implementation of Planar Maps in CGAL. The ACM Journal of Experimental Algorithmics, volume 5, 2000. Also in LNCS Vol. 1668 (WAE '99), Springer Verlag, pp. 154-168.
27. I. Hanniel and D. Halperin. Two-dimensional arrangements in CGAL and adaptive point location for parametric curves. Proc. of the 4th Workshop of Algorithm Engineering, Saarbrücken, Lecture Notes Comput. Sci., volume 1982, Springer Verlag, pp. 171-182, 2000.