Sequencing and scheduling moves for converting concave polyhedra

Details Sequencing and scheduling moves for converting concave polyhedra Sequencing and scheduling moves for converting concave polyhedra

1991-12-30

1994-05-31

Nguyen, Phu K.

395133, G06F 1562

Patent

active

053176812

ABSTRACT:
Methods for modifying shapes represented as non-self-intersecting, simply connected, triangulated polyhedra of genus-0, defined as a plurality of triangular faces, each triangular face defined as a set of three coordinate points, determine an ordering of concave edge elimination procedures which are required to smoothly convert a concave shape to its convex hull. The ordering technique attempts to avoid self-intersections and degeneracies in the metamorphs produced between the starting concave shape and its convex hull.

REFERENCES:
patent: 4901251 (1990-02-01), Sfarti
patent: 4962468 (1990-10-01), Beauregard et al.
patent: 4974177 (1990-11-01), Nishiguchi
patent: 5115479 (1992-05-01), Murayama
patent: 5129051 (1992-07-01), Cain
Kaul et al, "Research Report: Solid-Interpolating Deformations: Construction and Animation of Pips", IBM Research Division, Sep. 1991, p. 1-30.
Kent et al, "Establishing Correspondence by Topological Merging: A New Approach to 3-D Shape Transformation", Graphics Interface '91, Jun. 1991, pp. 271-278.

Affiliated with

Also associated with

Rating

Sequencing and scheduling moves for converting concave polyhedra does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Sequencing and scheduling moves for converting concave polyhedra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sequencing and scheduling moves for converting concave polyhedra will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1634290