Towards an implementation of the 3D visibility skeleton

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Towards an implementation of the 3D visibility skeleton

Full text

Pdf (158 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the twenty-third annual symposium on Computational geometry table of contents

Gyeongju, South Korea

SESSION: Session 4A: video session table of contents

Pages: 131 - 132

Year of Publication: 2007

ISBN:978-1-59593-705-6

Authors

Linqiao Zhang	McGill University, Montreal, PQ, Canada
Hazel Everett	INRIA Lorraine, Nancy, France
Sylvain Lazard	INRIA Lorraine, Nancy, France
Sue Whitesides	McGill University, Montreal, PQ, Canada

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
ACM: Association for Computing Machinery
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 31, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1247069.1247094 What is a DOI?

ABSTRACT

In this note we describe the contents of a video illustrating analgorithm for computing the 3D visibility skeleton ofa set of disjoint convex polytopes. The video can be foundat http://www.cs.mcgill.ca/~lzhang15/video/ with file name socg07visidemo.mov.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Free software distributed under the GNU General Public License (GPL).
	2	iMovie, Apple Computer Inc.
	3	P. Angelier and M. Pocchiola. CGAL-based implementation of visibility complexes. Technical Report ECG-TR-241207-01, Effective Computational Geometry for Curves and Surfaces (ECG), 2003.
	4	P. Angelier and M. Pocchiola. A sum of squares theorem for visibility complexes and applications. In B. Aronov, S. Basu, J. Pach, and M. Sharir, editors, Discrete and Computational Geometry, volume 25 of Algorithms and Combinatorics, pages 79--139. Springer-Verlag, 2003.
	5	H. Brönnimann, O. Devillers, V. Dujmovic, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S. Na, and S. Whitesides. Lines and free line segments tangent to arbitrary three-dimensional convex polyhedra. SIAM Journal on Computing, 2006. Accepted in 2006.
	6	CGAL: Computational Geometry Algorithms Library. http://www.cgal.org.
	7	The CORE library. http://cs.nyu.edu/exact/.
	8	F. Duguet and G. Drettakis. Robust epsilon visibility. In J. Hughes, editor, Proceedings of ACM SIGGRAPH 2002, pages 567--575. ACM Press / ACM SIGGRAPH, July 2002.
	9	Frédo Durand , George Drettakis , Claude Puech, The visibility skeleton: a powerful and efficient multi-purpose global visibility tool, Proceedings of the 24th annual conference on Computer graphics and interactive techniques, p.89-100, August 1997 [doi>10.1145/258734.258785]
	10	Frédo Durand , George Drettakis , Claude Puech, Fast and accurate hierarchical radiosity using global visibility, ACM Transactions on Graphics (TOG), v.18 n.2, p.128-170, April 1999 [doi>10.1145/318009.318012]
	11	H. Everett, S. Lazard, B. Lenhart, J. Redburn, and L. Zhang. Predicates for line transversals in 3d. In Proceedings of the 18th Canadian Conference on Computational Geometry (CCCG'06), Aug. 2006.
	12	Geomview. http://www.geomview.org.
	13	X. Goaoc. Structures de visibilité globales,: tailles, calculs et dégénérescences. Thèse d'université, Université Nancy 2, May 2004.
	14	M. Pocchiola and G. Vegter. Topologically sweeping visibility complexes via pseudo-triangulations. Discrete and Computational Geometry, 16(4):419--453, 1996. Proceedings of the 11th ACM Annual Symposium on Computational Geometry (SoCG'95).