We investigate the problem of determining visible regions in two or three dimensional space given a set of obstacles and a moving vantage point. This is of importance in several fields of study including rendering in computer graphics, etching in materials construction, and navigation. Our approach to this problem is through an implicit framework, where the obstacles are represented by a level set function. An efficient generic multiscale level set method is developed to generate the visible and invisible regions in space
The thesis proposes a taxonomy of visibility (vis.) problems based on the dimension of the problem-r...
In this thesis, we study visibility problems, which are geometric in nature. This leads us to the fi...
AbstractEfficiently identifying polygons that are visible from a changing synthetic viewpoint is an ...
Procedurally-defined implicit functions, such as CSG trees and recent neural shape representations, ...
International audienceVisibility computations are central in any computer graphics application. The ...
AbstractWe consider properties of sequences of spatial regions, as seen from a viewpoint. In particu...
We present the visibility octree, a new data structure to accelerate 3D navigation through very comp...
The visibility graph is a fundamental geometric structure which is useful in many applications, incl...
The notion of visibility is central in computer graphics and computational geometry. A visibility co...
International audienceThis chapter introduces global visibility computation using Grassmann Algebra....
This paper presents new approximated visibility algorithms. The aim is to develop output sensitive a...
This paper presents new approximated visibility algorithms. The aim is to develop output sensitive a...
International audienceThis paper proposes methods for efficient maintaining of the view around a poi...
Recent advances in 3D modeling provide us with real 3D datasets to answer queries, such as "Wha...
Abstract This chapter introduces global visibility computation using Grassmann Algebra. Visibility c...
The thesis proposes a taxonomy of visibility (vis.) problems based on the dimension of the problem-r...
In this thesis, we study visibility problems, which are geometric in nature. This leads us to the fi...
AbstractEfficiently identifying polygons that are visible from a changing synthetic viewpoint is an ...
Procedurally-defined implicit functions, such as CSG trees and recent neural shape representations, ...
International audienceVisibility computations are central in any computer graphics application. The ...
AbstractWe consider properties of sequences of spatial regions, as seen from a viewpoint. In particu...
We present the visibility octree, a new data structure to accelerate 3D navigation through very comp...
The visibility graph is a fundamental geometric structure which is useful in many applications, incl...
The notion of visibility is central in computer graphics and computational geometry. A visibility co...
International audienceThis chapter introduces global visibility computation using Grassmann Algebra....
This paper presents new approximated visibility algorithms. The aim is to develop output sensitive a...
This paper presents new approximated visibility algorithms. The aim is to develop output sensitive a...
International audienceThis paper proposes methods for efficient maintaining of the view around a poi...
Recent advances in 3D modeling provide us with real 3D datasets to answer queries, such as "Wha...
Abstract This chapter introduces global visibility computation using Grassmann Algebra. Visibility c...
The thesis proposes a taxonomy of visibility (vis.) problems based on the dimension of the problem-r...
In this thesis, we study visibility problems, which are geometric in nature. This leads us to the fi...
AbstractEfficiently identifying polygons that are visible from a changing synthetic viewpoint is an ...