Results 1 
5 of
5
Topologically Sweeping Visibility Complexes via Pseudotriangulations
, 1996
"... This paper describes a new algorithm for constructing the set of free bitangents of a collection of n disjoint convex obstacles of constant complexity. The algorithm runs in time O(n log n + k), where k is the output size, and uses O(n) space. While earlier algorithms achieve the same optimal run ..."
Abstract

Cited by 85 (9 self)
 Add to MetaCart
This paper describes a new algorithm for constructing the set of free bitangents of a collection of n disjoint convex obstacles of constant complexity. The algorithm runs in time O(n log n + k), where k is the output size, and uses O(n) space. While earlier algorithms achieve the same optimal running time, this is the first optimal algorithm that uses only linear space. The visibility graph or the visibility complex can be computed in the same time and space. The only complicated data structure used by the algorithm is a splittable queue, which can be implemented easily using redblack trees. The algorithm is conceptually very simple, and should therefore be easy to implement and quite fast in practice. The algorithm relies on greedy pseudotriangulations, which are subgraphs of the visibility graph with many nice combinatorial properties. These properties, and thus the correctness of the algorithm, are partially derived from properties of a certain partial order on the faces of th...
Making geometry visible: An introduction to the animation of geometric algorithms
 In Handbook on Computational Geometry, J.R. Sack and
, 1997
"... ..."
Using the Visibility Complex for Radiosity Computation
 In ACM Workshop Appl. Comput. Geom
, 1996
"... The radiosity method is particularly suitable for global illumination calculations in static environments. Nonetheless, for applications of image synthesis such as lighting design or architectural simulation, we have to deal with dynamic environments. To make the method usable in a real case, the il ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
(Show Context)
The radiosity method is particularly suitable for global illumination calculations in static environments. Nonetheless, for applications of image synthesis such as lighting design or architectural simulation, we have to deal with dynamic environments. To make the method usable in a real case, the illumination has to be updated as fast as possible after an object moves. The e#cient way is to find the calculations strictly necessary to be recomputed after a change in the scene. The largest part of the computation time is spent on visibility calculation. In this paper, we investigate the possible speed ups in those calculations. We propose the use of the visibility complex for radiosity calculations. The presented study is realized for 2D scenes of convex objects in the static case. We show that the visibility complex is very suitable for radiosity calculations in this context, and that it also allows for e#cient updates in the dynamic case. Keywords: radiosity, discontinuity meshing, for...
Discrete Comput Geom 16:419453 (1996) Discrete &Computational Geometry 1996 SpdngerVcrlag New York Inc. Topologically Sweeping Visibility Complexes via Pseudotriangulations*
"... Abstract. This paper describes anew algorithm for constructing the set of free bitangents of a collection of n disjoint convex obstacles of constant complexity. The algorithm runs in time O(nlogn + k), where k is the output size, and uses O(n) space. While earlier algorithms achieve the same optimal ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. This paper describes anew algorithm for constructing the set of free bitangents of a collection of n disjoint convex obstacles of constant complexity. The algorithm runs in time O(nlogn + k), where k is the output size, and uses O(n) space. While earlier algorithms achieve the same optimal running time, this is the first optimal algorithm that uses only linear space. The visibility graph or the visibility complex can be computed in the same time and space. The only complicated data structure used by the algorithm is a splittable queue, which can be implemented easily using redblack trees. The algorithm is conceptually very simple, and should therefore be easy to implement and quite fast in practice. The algorithm relies on greedy pseudotriangulations, which are subgraphs of the visibility graph with many nice combinatorial properties. These properties, and thus the correctness ofthe algorithm, are partially derived from properties of a certain partial order on the faces of the visibility complex. 1.