Add to ORKGOptimal Guarding: Given a 3D region M, to find a smallest set of points {gi} ∈M to which the entire region ∀p ∈ M is visible. Star Decomposition: To partition a 3D region to a set of star sub-regions (each star shape is visible from an interior point)
We present the first constant-factor approximation algorithm for a non-trivial instance of the optim...
The 1.5-dimensional terrain guarding problem gives an x-monotone chain (the terrain) and asks for t...
summary:In this paper, we propose a novel algorithm for a decomposition of 3D binary shapes to recta...
We propose an efcient algorithm to compute 3D region guarding and star decomposition. A star decompo...
This paper proposes an effective framework to compute the visibility guarding and star decomposition...
This paper proposes an effective framework to compute the visibility guarding and star decomposition...
With the advance of scanning devices, 3-d geometric models have been captured and widely used in ani...
We consider the problem of determining the placement of a star R on a set P of n points in the plane...
This paper presents two algorithms for autonomously selecting the best projection among all possible...
Motivated by applications in computer graphics, we study the problem of computing an optimal encodin...
A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two v...
To make computations on large data sets more efficient, algorithms will frequently divide informatio...
Distinguished Alumni Award Program author. Rear Admiral David H. Lewis, U.S. Navy, Commander, Space ...
International audienceWe propose a purely discrete deformable partition model for segmenting 3D imag...
Guarding of an environment by cameras or guards is a longstanding problem in computational geometry....
We present the first constant-factor approximation algorithm for a non-trivial instance of the optim...
The 1.5-dimensional terrain guarding problem gives an x-monotone chain (the terrain) and asks for t...
summary:In this paper, we propose a novel algorithm for a decomposition of 3D binary shapes to recta...
We propose an efcient algorithm to compute 3D region guarding and star decomposition. A star decompo...
This paper proposes an effective framework to compute the visibility guarding and star decomposition...
This paper proposes an effective framework to compute the visibility guarding and star decomposition...
With the advance of scanning devices, 3-d geometric models have been captured and widely used in ani...
We consider the problem of determining the placement of a star R on a set P of n points in the plane...
This paper presents two algorithms for autonomously selecting the best projection among all possible...
Motivated by applications in computer graphics, we study the problem of computing an optimal encodin...
A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two v...
To make computations on large data sets more efficient, algorithms will frequently divide informatio...
Distinguished Alumni Award Program author. Rear Admiral David H. Lewis, U.S. Navy, Commander, Space ...
International audienceWe propose a purely discrete deformable partition model for segmenting 3D imag...
Guarding of an environment by cameras or guards is a longstanding problem in computational geometry....
We present the first constant-factor approximation algorithm for a non-trivial instance of the optim...
The 1.5-dimensional terrain guarding problem gives an x-monotone chain (the terrain) and asks for t...
summary:In this paper, we propose a novel algorithm for a decomposition of 3D binary shapes to recta...