Sciweavers

195 search results - page 5 / 39
» Fitting a Set of Points by a Circle
Sort
View
COMPUTING
2006
102views more  COMPUTING 2006»
13 years 8 months ago
A Reliable Area Reduction Technique for Solving Circle Packing Problems
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
Mihály Csaba Markót, Tibor Csendes
CCCG
2007
13 years 10 months ago
Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
Arindam Karmakar, Sasanka Roy, Sandip Das
CGF
2008
227views more  CGF 2008»
13 years 8 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
IEICET
2006
55views more  IEICET 2006»
13 years 8 months ago
Inserting Points Uniformly at Every Instance
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjam...
CAGD
2004
113views more  CAGD 2004»
13 years 8 months ago
Developable surface fitting to point clouds
Given a set of data points as measurements from a developable surface, the present paper investigates the recognition and reconstruction of these objects. We investigate the set o...
Martin Peternell