Results 1  10
of
386,206
Geometric Algorithms for . . .
, 2009
"... This work presents novel geometric algorithms dealing with algebraic curves and surfaces of arbitrary degree. These algorithms are exact and complete – they return the mathematically true result for all input instances. Efficiency is achieved by cutting back expensive symbolic computation and favori ..."
Abstract
 Add to MetaCart
This work presents novel geometric algorithms dealing with algebraic curves and surfaces of arbitrary degree. These algorithms are exact and complete – they return the mathematically true result for all input instances. Efficiency is achieved by cutting back expensive symbolic computation
Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms
 ACM TRANS. GRAPH
, 1990
"... This paper describes a generalpurpose programming technique, called the Simulation of Simplicity, which can be used to cope with degenerate input data for geometric algorithms. It relieves the programmer from the task to provide a consistent treatment for every single special case that can occur. T ..."
Abstract

Cited by 310 (19 self)
 Add to MetaCart
This paper describes a generalpurpose programming technique, called the Simulation of Simplicity, which can be used to cope with degenerate input data for geometric algorithms. It relieves the programmer from the task to provide a consistent treatment for every single special case that can occur
Bitparalleling geometrical algorithms
"... Consideration is being given to problem of the geometrical algorithms parallel calculations, which based on Volder and Meggitt algorithms modification. Carefully analyzed are the parallel calculations and correction. Modeling results are given. Key words: geometrical processors, Volder and Meggitt a ..."
Abstract
 Add to MetaCart
Consideration is being given to problem of the geometrical algorithms parallel calculations, which based on Volder and Meggitt algorithms modification. Carefully analyzed are the parallel calculations and correction. Modeling results are given. Key words: geometrical processors, Volder and Meggitt
Geometric Algorithms for Trap Design
 15th ACM Symposium on Computational Geometry
, 1998
"... Geometric algorithms have successfully been applied to solve or give insight into problems in robotic manipulation. In this paper, we present a framework to filter polygonal parts on a track. The filter consists of a polygonal hole in the track; we refer to the filters as traps. For an nsided poly ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Geometric algorithms have successfully been applied to solve or give insight into problems in robotic manipulation. In this paper, we present a framework to filter polygonal parts on a track. The filter consists of a polygonal hole in the track; we refer to the filters as traps. For an n
Two Geometric Algorithms for Layout Analysis
 In Workshop on Document Analysis Systems
, 2002
"... This paper presents geometric algorithms for solving two key problems in layout analysis: finding a cover of the background whitespace of a document in terms of maximal empty rectangles, and finding constrained maximum likelihood matches of geometric text line models in the presence of geometric ..."
Abstract

Cited by 52 (12 self)
 Add to MetaCart
This paper presents geometric algorithms for solving two key problems in layout analysis: finding a cover of the background whitespace of a document in terms of maximal empty rectangles, and finding constrained maximum likelihood matches of geometric text line models in the presence of geometric
Geometric Algorithms for Online Optimization
 Journal of Computer and System Sciences
, 2002
"... In this paper, we consider a natural online version of linear optimization: the problem has to be solved repeatedly over a sequence of periods, where the objective direction for the upcoming period is unknown. This models online versions of optimization problems, such as maxcut, variants of cluster ..."
Abstract

Cited by 38 (1 self)
 Add to MetaCart
of clustering, and also the classic online binary search tree problem. We present algorithms for this problem that are (1 + epsilon)competitive with the optimal static solution chosen in hindsight. Our algorithms and proofs are motivated by geometric considerations.
Geometric Algorithms for Reconfigurable Structures
, 2011
"... In this thesis, we study three problems related to geometric algorithms of reconfigurable structures. In the first problem, strip folding, we present two universal hinge patterns for a strip of material that enable the folding of any integral orthogonal polyhedron of only a constant factor smaller s ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this thesis, we study three problems related to geometric algorithms of reconfigurable structures. In the first problem, strip folding, we present two universal hinge patterns for a strip of material that enable the folding of any integral orthogonal polyhedron of only a constant factor smaller
Sublinear geometric algorithms
 In Proc. of the 35th Annual ACM Symp. on Theory of Computing
, 2003
"... Abstract. We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons and polyhedra, point location in twodimensional triangulations and Voronoi diagrams, and ray shooting in convex ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
Abstract. We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons and polyhedra, point location in twodimensional triangulations and Voronoi diagrams, and ray shooting
Realistic Input Models for Geometric Algorithms
 IN PROC. 13TH ANNU. ACM SYMPOS. COMPUT. GEOM
, 1997
"... Many algorithms developed in computational geometry are needlessly complicated and slow because they have to be prepared for very complicated, hypothetical inputs. To avoid this, realistic models are needed that describe the properties that realistic inputs have, so that algorithms can de designed t ..."
Abstract

Cited by 98 (20 self)
 Add to MetaCart
Many algorithms developed in computational geometry are needlessly complicated and slow because they have to be prepared for very complicated, hypothetical inputs. To avoid this, realistic models are needed that describe the properties that realistic inputs have, so that algorithms can de designed
Instanceoptimal geometric algorithms
"... ... in 2d and 3d, and offline point location in 2d. We prove the existence of an algorithm A for computing 2d or 3d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for every algorithm A ′ in a certain class A, the maximum running time of ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
... in 2d and 3d, and offline point location in 2d. We prove the existence of an algorithm A for computing 2d or 3d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for every algorithm A ′ in a certain class A, the maximum running time
Results 1  10
of
386,206