Results 1  10
of
3,735
Surface Reconstruction by Voronoi Filtering
 Discrete and Computational Geometry
, 1998
"... We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled ..."
Abstract

Cited by 418 (15 self)
 Add to MetaCart
surface from scattered sample points arises in many applications such as computer graphics, medical imaging, and cartography. In this paper we consider the specific reconstruction problem in which the input is a set of sample points S drawn from a smooth twodimensional manifold F embedded in three
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
into the toolkit of every algorithm designer. The purpose of the seminar was to bring together leading experts from all over the world, and from the diverse areas of computer science that have been attracted to this new framework. The seminar was intended as the rst larger international meeting with a specic focus
FAST VOLUME RENDERING USING A SHEARWARP FACTORIZATION OF THE VIEWING TRANSFORMATION
, 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that req ..."
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning under uncertainty, sensorbased planning, visibility, decisiontheoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.
Edgeguarding Orthogonal Polyhedra
"... We address the question: How many edge guards are needed to guard an orthogonal polyhedron of e edges, r of which are reflex? It was previously established [3] that e/12 are sometimes necessary and e/6 always suffice. In contrast to the closed edge guardsused for these bounds, we introduce a new mod ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We address the question: How many edge guards are needed to guard an orthogonal polyhedron of e edges, r of which are reflex? It was previously established [3] that e/12 are sometimes necessary and e/6 always suffice. In contrast to the closed edge guardsused for these bounds, we introduce a new
Ununfoldable polyhedra with convex faces
 COMPUT. GEOM. THEORY APPL
, 2002
"... Unfolding a convex polyhedron into a simple planar polygon is a wellstudied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In particular, we give two examples of polyhedra, one with 24 convex fa ..."
Abstract

Cited by 26 (10 self)
 Add to MetaCart
Unfolding a convex polyhedron into a simple planar polygon is a wellstudied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In particular, we give two examples of polyhedra, one with 24 convex
Reconstructing Orthogonal Polyhedra from Putative Vertex Sets
"... Abstract. In this paper we study the problem of reconstructing orthogonal polyhedra from a putative vertex set, i.e., we are given a set of points and want to find an orthogonal polyhedron for which this is the set of vertices. We are especially interested in testing whether such a polyhedron is uni ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. In this paper we study the problem of reconstructing orthogonal polyhedra from a putative vertex set, i.e., we are given a set of points and want to find an orthogonal polyhedron for which this is the set of vertices. We are especially interested in testing whether such a polyhedron
Multiresolution Analysis for Surfaces Of Arbitrary . . .
, 1993
"... Multiresolution analysis provides a useful and efficient tool for representing shape and analyzing features at multiple levels of detail. Although the technique has met with considerable success when applied to univariate functions, images, and more generally to functions defined on lR , to our k ..."
Abstract

Cited by 390 (3 self)
 Add to MetaCart
Multiresolution analysis provides a useful and efficient tool for representing shape and analyzing features at multiple levels of detail. Although the technique has met with considerable success when applied to univariate functions, images, and more generally to functions defined on lR , to our knowledge it has not been extended to functions defined on surfaces of arbitrary genus. In this
STEINITZ THEOREMS FOR SIMPLE ORTHOGONAL POLYHEDRA
 JOURNAL OF COMPUTATIONAL GEOMETRY
, 2014
"... We define a simple orthogonal polyhedron to be a threedimensional polyhedron with the topology of a sphere in which three mutuallyperpendicular edges meet at each vertex. By analogy to Steinitzâ€™s theorem characterizing the graphs of convex polyhedra, we find graphtheoretic characterizations of t ..."
Abstract
 Add to MetaCart
We define a simple orthogonal polyhedron to be a threedimensional polyhedron with the topology of a sphere in which three mutuallyperpendicular edges meet at each vertex. By analogy to Steinitzâ€™s theorem characterizing the graphs of convex polyhedra, we find graphtheoretic characterizations
Small deformations of polygons and polyhedra
 math.DG/0410058. To appear, Trans. Amer. Math. Soc
, 2004
"... Abstract. We describe the firstorder variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a vectorvalued quadratic invariant b on the space of those isometric ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
deformations which, for convex polygons, has a remarkable positivity property. We give two geometric applications. The first is an isoperimetric statement for hyperbolic polygons: Among the convex hyperbolic polygons with given edge lengths, there is a unique polygon with vertices on a circle, a horocycle
Results 1  10
of
3,735