Chanderjit L. Bajaj

Convex decomposition of polyhedra and robustness

This paper presents a simple algorithm to compute a convex decomposition of a nonconvex polyhedron of arbitrary genus (handles) and shells (internal voids). For such a polyhedron S with n edges and rnotches (features causing nonconvexity in polyhedra), the algorithm produces a worst-case optimal

Automatic parameterization of rational curves and surfaces III: algebraic plane curves

O(r^2 )

Algebraic surface design with Hermite interpolation

number of convex polyhedra

Generation of configuration space obstacles: The case of moving algebraic curves

S_i

On good triangulations in three dimensions

, with

Automatic parameterization of rational curves and surfaces IV: algebraic space curves

U_{i = 1}^k S_i = S

Automatic parametrization of rational curves and surfaces II: cubics and cubicoids

, in

Automatic parameterization of rational curves and surfaces 1: conics and conicoids

O(nr^2 + r^{7/2} )

Rational hypersurface display

time and

ON GOOD TRIANGULATIONS IN THREE DIMENSIONS

O(nr + r^{5/2} )