Sciweavers

9659 search results - page 40 / 1932
» Points on Computable Curves
Sort
View
ICPP
2006
IEEE
14 years 3 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru
ICPR
2000
IEEE
14 years 2 months ago
Rubber Band Algorithm for Estimating the Length of Digitized Space-Curves
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
Thomas Bülow, Reinhard Klette
CGF
2008
227views more  CGF 2008»
13 years 9 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...
COMPGEOM
2004
ACM
14 years 1 months ago
Complete, exact, and efficient computations with cubic curves
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...
Arno Eigenwillig, Lutz Kettner, Elmar Schömer...
GMP
2002
IEEE
172views Solid Modeling» more  GMP 2002»
14 years 2 months ago
Classifying the Nonsingular Intersection Curve of Two Quadric Surfaces
We present new results on classifying the morphology of the nonsingular intersection curve of two quadrics by studying the roots of the characteristic equation, or the discriminan...
Changhe Tu, Wenping Wang, Jiaye Wang