On the Size of the 3D Visibility Skeleton: Experimental Results (2009)
Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides
Abstract. The 3D visibility skeleton is a data structure used to encode global visibility information about a set of objects. Previous theoretical results have shown that for k convex polytopes with...
On the three-dimensional visibility skeleton: implementation and analysis (2009)
The visibility skeleton is a data structure that encodes global visibility information of a given scene in either 2D or 3D. While this data structure is in principle very useful in answering global...
Squelette de visibilité en trois dimensions: implantation et analyse (2009)
Le squelette de visibilité est une structure de donnée qui encode l'information de visibilité globale pour une scène donnée en 2D ou 3D. Cette structure de donnée est en principe très utile...
Squelette de visibilité en trois dimensions: implantation et analyse (2009)
Le squelette de visibilité est une structure de donnée qui encode l'information de visibilité globale pour une scène donnée en 2D ou 3D. Cette structure de donnée est en principe très utile...
Squelette de visibilité en trois dimensions: implantation et analyse (2009)
Le squelette de visibilité est une structure de donnée qui encode l'information de visibilité globale pour une scène donnée en 2D ou 3D. Cette structure de donnée est en principe très utile...
On the Degree of Standard Geometric Predicates for Line Transversals in 3D (2009)
Everett, Hazel, Lazard, Sylvain, Lenhart, Bill, Zhang, Linqiao
In this paper we study various geometric predicates for determining the existence of and categorizing the configurations of lines in 3D that are transversal to lines or segments. We compute the...
On the Degree of Standard Geometric Predicates for Line Transversals in 3D (2009)
Everett, Hazel, Lazard, Sylvain, Lenhart, Bill, Zhang, Linqiao
In this paper we study various geometric predicates for determining the existence of and categorizing the configurations of lines in 3D that are transversal to lines or segments. We compute the...
Abstract Predicates for Line Transversals in 3D (2008)
Hazel Everett, Sylvian Lazard, Bill Lenhart, Jeremy Redburn, Linqiao Zhang
In this paper we study various predicates concerning line transversals to lines and segments in 3D. We compute the degrees of standard methods of evaluating these predicates. The degrees of some of...
Categories and Subject Descriptors: F.2.2 [Nonnumerical Algorithms (2008)
In this note we describe the contents of a video illustrating an algorithm for computing the 3D visibility skeleton of a set of disjoint convex polytopes. The video can be found at
Abstract Predicates for Line Transversals in 3D (2008)
Hazel Everett, Sylvian Lazard, Bill Lenhart, Jeremy Redburn, Linqiao Zhang
In this paper we study various predicates concerning line transversals to lines and segments in 3D. We compute the degrees of standard methods of evaluating these predicates. The degrees of some of...
General Terms: Algorithms (2008)
In this note we describe the contents of a video illustrating an algorithm for computing the 3D visibility skeleton of a set of disjoint convex polytopes. The video can be found at
On the Size of the 3D Visibility Skeleton: Experimental Results (2008)
Zhang, Linqiao, Everett, Hazel, Lazard, Sylvain, Weibel, Christophe, Whitesides, Sue
The 3D visibility skeleton is a data structure used to encode global visibility information about a set of objects. Previous theoretical results have shown that for $k$ convex polytopes with $n$...
On the Size of the 3D Visibility Skeleton: Experimental Results (2008)
Zhang, Linqiao, Everett, Hazel, Lazard, Sylvain, Weibel, Christophe, Whitesides, Sue
The 3D visibility skeleton is a data structure used to encode global visibility information about a set of objects. Previous theoretical results have shown that for $k$ convex polytopes with $n$...
On the degree of standard geometric predicates for line transversals (2008)
Hazel Everett, Sylvain Lazard, William Lenhart, Jeremy Redburn, Linqiao Zhang
In this paper we study various geometric predicates for determining the existence of and categorizing the configurations of lines in 3D that are transversal to lines or segments. We compute the...
On the Expected Size of the 2D Visibility Complex (2007)
Everett, Hazel, Lazard, Sylvain, Petitjean, Sylvain, Zhang, Linqiao
We study the expected size of the 2D visibility complex of randomly distributed objects in the plane. We prove that the asymptotic expected number of free bitangents (which correspond to 0-faces of...
On the Expected Size of the 2D Visibility Complex (2007)
Everett, Hazel, Lazard, Sylvain, Petitjean, Sylvain, Zhang, Linqiao
We study the expected size of the 2D visibility complex of randomly distributed objects in the plane. We prove that the asymptotic expected number of free bitangents (which correspond to 0-faces of...
Towards an Implementation of the 3D Visibility Skeleton (2007)
Zhang, Linqiao, Everett, Hazel, Lazard, Sylvain, Whitesides, Sue
In this note we describe the contents of a video illustrating an algorithm for computing the 3D visibility skeleton of a set of disjoint convex polytopes.
Towards an Implementation of the 3D Visibility Skeleton (2007)
Zhang, Linqiao, Everett, Hazel, Lazard, Sylvain, Whitesides, Sue
In this note we describe the contents of a video illustrating an algorithm for computing the 3D visibility skeleton of a set of disjoint convex polytopes.
On the Expected Size of the 2D Visibility Complex (2006)
Everett, Hazel, Lazard, Sylvain, Petitjean, Sylvain, Zhang, Linqiao
We study the expected size of the 2D visibility complex of randomly distributed objects in the plane. We prove that the expected asymptotic number of free bitangents (which correspond to the 0-faces...
On the Expected Size of the 2D Visibility Complex (2006)
Everett, Hazel, Lazard, Sylvain, Petitjean, Sylvain, Zhang, Linqiao
We study the expected size of the 2D visibility complex of randomly distributed objects in the plane. We prove that the expected asymptotic number of free bitangents (which correspond to the 0-faces...
Predicates for Line Transversals in 3D (2006)
Everett, Hazel, Lazard, Sylvain, Lenhart, Bill, Redburn, Jeremy, Zhang, Linqiao
In this paper we study various predicates concerning line transversals to lines and segments in 3D. We compute the degrees of standard methods of evaluating these predicates. The degrees of some of...
Predicates for Line Transversals in 3D (2006)
Everett, Hazel, Lazard, Sylvain, Lenhart, Bill, Redburn, Jeremy, Zhang, Linqiao
In this paper we study various predicates concerning line transversals to lines and segments in 3D. We compute the degrees of standard methods of evaluating these predicates. The degrees of some of...
Predicates for Line Transversals in 3D (2006)
Everett, Hazel, Lazard, Sylvain, Lenhart, Bill, Redburn, Jeremy, Zhang, Linqiao
In this paper we study various predicates concerning line transversals to lines and segments in 3D. We compute the degrees of standard methods of evaluating these predicates. The degrees of some of...
On the Expected Size of the 2D Visibility Complex (2006)
Everett, Hazel, Lazard, Sylvain, Petitjean, Sylvain, Zhang, Linqiao
We study the expected size of the 2D visibility complex of randomly distributed objects in the plane. We prove that the expected asymptotic number of free bitangents (which correspond to the 0-faces...
An Experimental Assessment of the 2D Visibility Complex (2005)
Everett, Hazel, Lazard, Sylvain, Petitjean, Sylvain, Zhang, Linqiao
We make an experimental assessment of the size of the 2D visibility complex of disjoint unit discs randomly distributed in the plane with density $\mu$. We observe that the number of free bitangents...
An Experimental Assessment of the 2D Visibility Complex (2005)
Everett, Hazel, Lazard, Sylvain, Petitjean, Sylvain, Zhang, Linqiao
We make an experimental assessment of the size of the 2D visibility complex of disjoint unit discs randomly distributed in the plane with density $\mu$. We observe that the number of free bitangents...
An Experimental Assessment of the 2D Visibility Complex (2005)
Everett, Hazel, Lazard, Sylvain, Petitjean, Sylvain, Zhang, Linqiao
We make an experimental assessment of the size of the 2D visibility complex of disjoint unit discs randomly distributed in the plane with density $\mu$. We observe that the number of free bitangents...
On the expected size of the 2d visibility complex (2005)
Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang
We study the expected size of the 2D visibility complex of randomly distributed objects in the plane. We prove that the asymptotic expected number of free bitangents (which correspond to 0-faces of...
An experimental assessment of the 2d visibility complex (2005)
Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang
We make an experimental assessment of the size of the 2D visibility complex of disjoint unit discs randomly distributed in the plane with density µ. We observe that the number of free bitangents is...
Rendering falling snow using an inverse fourier transform (2004)
Michael S. Langer, Linqiao Zhang
Methods for rendering falling snow typically use particle systems [MaAllister 2000] which require tens of thousands of particles (snowflakes), and thus can be expensive. Here we present an...