Results 1  10
of
33
Simplification Envelopes
"... We propose the idea of simplification envelopes for generating a hierarchy of levelofdetail approximations for a given polygonal model. Our approach guarantees that all points of an approximation are within a userspecifiable distance # from the original model and that all points of the original m ..."
Abstract

Cited by 205 (17 self)
 Add to MetaCart
We propose the idea of simplification envelopes for generating a hierarchy of levelofdetail approximations for a given polygonal model. Our approach guarantees that all points of an approximation are within a userspecifiable distance # from the original model and that all points of the original model are within a distance # from the approximation. Simplificationenvelopes provide a general framework within which a large collection of existing simplification algorithms can run. We demonstrate this technique in conjunction with two algorithms, one local, the other global. The local algorithm provides a fast method for generating approximations to large input meshes (at least hundreds of thousands of triangles). The global algorithm provides the opportunity to avoid local "minima" and possibly achieve better simplifications as a result. Each approximation attempts to minimize the total number of polygons required to satisfy the above # constraint. The key advantages of our approach are...
Discrete Geometric Shapes: Matching, Interpolation, and Approximation: A Survey
 Handbook of Computational Geometry
, 1996
"... In this survey we consider geometric techniques which have been used to measure the similarity or distance between shapes, as well as to approximate shapes, or interpolate between shapes. Shape is a modality which plays a key role in many disciplines, ranging from computer vision to molecular biolog ..."
Abstract

Cited by 149 (10 self)
 Add to MetaCart
(Show Context)
In this survey we consider geometric techniques which have been used to measure the similarity or distance between shapes, as well as to approximate shapes, or interpolate between shapes. Shape is a modality which plays a key role in many disciplines, ranging from computer vision to molecular biology. We focus on algorithmic techniques based on computational geometry that have been developed for shape matching, simplification, and morphing. 1 Introduction The matching and analysis of geometric patterns and shapes is of importance in various application areas, in particular in computer vision and pattern recognition, but also in other disciplines concerned with the form of objects such as cartography, molecular biology, and computer animation. The general situation is that we are given two objects A, B and want to know how much they resemble each other. Usually one of the objects may undergo certain transformations like translations, rotations or scalings in order to be matched with th...
Efficient algorithms for geometric optimization
 ACM Comput. Surv
, 1998
"... We review the recent progress in the design of efficient algorithms for various problems in geometric optimization. We present several techniques used to attack these problems, such as parametric searching, geometric alternatives to parametric searching, pruneandsearch techniques for linear progra ..."
Abstract

Cited by 117 (12 self)
 Add to MetaCart
We review the recent progress in the design of efficient algorithms for various problems in geometric optimization. We present several techniques used to attack these problems, such as parametric searching, geometric alternatives to parametric searching, pruneandsearch techniques for linear programming and related problems, and LPtype problems and their efficient solution. We then describe a variety of applications of these and other techniques to numerous problems in geometric optimization, including facility location, proximity problems, statistical estimators and metrology, placement and intersection of polygons and polyhedra, and ray shooting and other querytype problems.
Controlled Topology Simplification
 IEEE Trans. Visualization and Computer Graphics
, 1996
"... ..."
CounterExample Guided Predicate Abstraction of Hybrid Systems
, 2003
"... Predicate abstraction has emerged to be a powerful technique for extracting finitestate models from infinitestate systems, and has been recently shown to enhance the effectiveness of the reachability computation techniques for hybrid systems. Given a hybrid system with linear dynamics and a set of ..."
Abstract

Cited by 43 (8 self)
 Add to MetaCart
(Show Context)
Predicate abstraction has emerged to be a powerful technique for extracting finitestate models from infinitestate systems, and has been recently shown to enhance the effectiveness of the reachability computation techniques for hybrid systems. Given a hybrid system with linear dynamics and a set of linear predicates, the verifier performs an onthefly search of the finite discrete quotient whose states correspond to the truth assignments to the input predicates. The success of this approach crucially depends on the choice of the predicates used for abstraction. In this paper, we focus on identifying these predicates automatically by analyzing spurious counterexamples generated by the search in the abstract statespace. We present the basic techniques for discovering new predicates that will rule out closely related spurious counterexamples, optimizations of these techniques, implementation of these in the verification tool, and case studies demonstrating the promise of the approach.
Hierarchical Geometric Approximations
, 1994
"... This dissertation explores some techniques for automatic approximation of geometric objects. My thesis is that using and extending concepts from computational geometry can help us in devising efficient and parallelizable algorithms for automatically constructing useful detail hierarchies for geometr ..."
Abstract

Cited by 38 (4 self)
 Add to MetaCart
This dissertation explores some techniques for automatic approximation of geometric objects. My thesis is that using and extending concepts from computational geometry can help us in devising efficient and parallelizable algorithms for automatically constructing useful detail hierarchies for geometric objects. We have demonstrated this by developing new algorithms for two kinds of geometric approximation problems that have been motivated by a single driving problem  the efficient computation and display of smooth solventaccessible molecular surfaces. The applications of these detail hierarchies are in biochemistry and computer graphics. The smooth solventaccessible surface of a molecule is useful in studying the structure and interactions of proteins, in particular for attacking the proteinsubstrate docking problem. We have developed a parallel lineartime algorithm for computing molecular surfaces. Molecular surfaces are equivalent to the weighted ffhulls. Thus our work is pot...
Separation and Approximation of Polyhedral Objects
, 1993
"... Given a family of disjoint polygons P1, P2, : ::, Pk in the plane, and an integer parameter m, it is NPcomplete to decide if the Pi's can be pairwise separated by a polygonal family with at most m edges, that is, if there exist polygons R1; R2; : ::; Rk with pairwisedisjoint boundaries such t ..."
Abstract

Cited by 30 (4 self)
 Add to MetaCart
Given a family of disjoint polygons P1, P2, : ::, Pk in the plane, and an integer parameter m, it is NPcomplete to decide if the Pi's can be pairwise separated by a polygonal family with at most m edges, that is, if there exist polygons R1; R2; : ::; Rk with pairwisedisjoint boundaries such that Pi Ri andP jRij m. In three dimensions, the problem is NPcomplete even for two nested convex polyhedra. Many other extensions and generalizations of the polyhedral separation problem, either to families of polyhedra or to higher dimensions, are also intractable. In this paper, we present e cient approximation algorithms for constructing separating families of nearoptimal size. Our main results are as follows. In two dimensions, we give an O(n log n) time algorithm for constructing a separating family whose size is within a constant factor of an optimal separating family; n is the number of edges in the input family of polygons. In three dimensions, we show how to separate a convex polyhedron from a nonconvex polyhedron with a polyhedral surface whose facetcomplexity is O(log n) times the optimal, where n = jPj+jQj is the complexity of the input polyhedra. Our algorithm runs in O(n4) time, but improves to O(n3) time if the two polyhedra are nested and convex. Our algorithm for separating a convex polyhedron from a nonconvex polyhedron extends to higher dimensions. In d dimensions, for d 4, the facetcomplexity of the approximation polyhedron is O(d log n) times the optimal, and the algorithm runs in O(nd+1) time. Finally, we also obtain results on separating sets of points, a family of convex polyhedra, and separation by nonpolyhedral surfaces, such as spherical patches.
On the Complexity of Optimization Problems for 3Dimensional Convex Polyhedra and Decision Trees
 Comput. Geom. Theory Appl
, 1995
"... We show that several wellknown optimization problems involving 3dimensional convex polyhedra and decision trees are NPhard or NPcomplete. One of the techniques we employ is a lineartime method for realizing a planar 3connected triangulation as a convex polyhedron, which may be of independent i ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
(Show Context)
We show that several wellknown optimization problems involving 3dimensional convex polyhedra and decision trees are NPhard or NPcomplete. One of the techniques we employ is a lineartime method for realizing a planar 3connected triangulation as a convex polyhedron, which may be of independent interest. Key words: Convex polyhedra, approximation, Steinitz's theorem, planar graphs, art gallery theorems, decision trees. 1 Introduction Convex polyhedra are fundamental geometric structures (e.g., see [20]). They are the product of convex hull algorithms, and are key components for problems in robot motion planning and computeraided geometric design. Moreover, due to a beautiful theorem of Steinitz [20, 38], they provide a strong link between computational geometry and graph theory, for Steinitz shows that a graph forms the edge structure of a convex polyhedra if and only if it is planar and 3connected. Unfortunately, algorithmic problems dealing with 3dimensional convex polyhedra ...
Approximation algorithms for geometric separation problems
 Department of
, 1993
"... In computer graphics and solid modeling, one is interested in representing complex geometric objects with combinatorially simpler ones. It turns out that via a “fattening ” transformation, one obtains a formulation of the approximation problem in terms of separation: Find a minimumcomplexity surface ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
(Show Context)
In computer graphics and solid modeling, one is interested in representing complex geometric objects with combinatorially simpler ones. It turns out that via a “fattening ” transformation, one obtains a formulation of the approximation problem in terms of separation: Find a minimumcomplexity surface that separates two sets. In this paper, we provide approximation algorithms for several geometric separation problems, including: • Given a set of triangles T and a set S of points that lie within the union of the triangles, find a minimumcardinality set, T ′ , of pairwisedisjoint triangles, each contained within some triangle of T, that cover the point set S. • Given finite sets of “red ” and “blue ” points in the plane, determine a simple polygon of fewest edges that separates the red points from the blue points. More generally, given finite sets of points of many color classes, determine a planar “separating ” subdivision of minimum combinatorial complexity, which has the property that each face of the subdivision contains points of at most one color class; • Given two polyhedral terrains, P and Q, over a common support set (e.g., the unit square), with P lying above Q, compute a nested polyhedral terrain R that lies between P and Q such that R has a minimum number of facets. Exact solution of the above problems in polynomial time is highly unlikely: The decision versions of all three problems are known to be NPhard. We provide polynomialtime algorithms that are guaranteed to produce an answer within a logarithmic factor (O(log n), where n is the complexity of the input problem instance) of optimal. (The error factor is constant in the orthogonal case — coverage by disjoint aligned rectangles, or separation of orthohedral terrains.) We also discuss extensions to higher dimensions. 1
Randomized algorithms for geometric optimization problems
 Handbook of Randomized Computation
, 2001
"... This chapter reviews randomization algorithms developed in the last few years to solve a wide range of geometric optimization problems. We rst review a number of general techniques, including randomized binary search, randomized linearprogramming algorithms, and random sampling. Next, we describe s ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(Show Context)
This chapter reviews randomization algorithms developed in the last few years to solve a wide range of geometric optimization problems. We rst review a number of general techniques, including randomized binary search, randomized linearprogramming algorithms, and random sampling. Next, we describe several applications of these and other techniques, including facility location, proximity problems, statistical estimators, nearest neighbor searching, and Euclidean TSP.