1879 search results - page 174 / 376 » Computational geometry algorithms library |
154
click to vote
ICCTA
2007
IEEE
15 years 11 months ago
2007
IEEE
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
117
click to vote
TOG
2008
15 years 4 months ago
2008
We present a novel method for procedurally modeling large complex shapes. Our approach is general-purpose and takes as input any 3D polyhedral model provided by a user. The algori...
146
click to vote
COMPGEOM
2006
ACM
15 years 11 months ago
2006
ACM
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
130
Voted
COMPGEOM
2006
ACM
15 years 11 months ago
2006
ACM
Abstract This paper describes an algorithm for generating a guaranteed intersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prio...
134
Voted
COMPGEOM
2006
ACM
15 years 11 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...