Catálogo de publicaciones - libros

In this paper, we study the problem of reconstructing the polyhedral structures and geometric positions of a general D polyhedral scene from a single 2D line drawing. With the idea of local construction and propagation, we propose several powerful techniques for structural reconstruction (i.e. face identification) and geometric reconstruction (i.e. realizability and parametrization). Our structural reconstruction algorithm can handle 3D solids of over 10,000 faces efficiently, outperforming any other existing method. Our geometric reconstruction algorithm can lead to amazing simplification in symbolic manipulation of the geometric data, and can be used to find linear construction sequences for non-spherical polyhedra.

In this paper, we introduce the concept of (GSP) consisting of two rigid bodies connected with three constraints between three pairs of geometric primitives in the two rigid bodies respectively. This problem can be treated as a special but important class of geometric constraint solving problems. We show that there exist sixteen forms of planar GSPs. We also obtain the closed-form solutions of the direct kinematics for the planar GSPs. For a class of GSPs with two distance and one angular constraints, we may give pure geometric solutions based on ruler and compass constructions.