Learn More
A new topological algorithm is presented that generates all the faces of a genus O, 3-connected wireframe in 0(nz2) time, where m is the number of edges of the wire-frame. It is based on an eftlcient shortest path rdgorithm for cycle generation. The completely general wireframe to solid model conversion problem is also shown to be com-binatorially(More)
This paper studies matching of fragmented objects to re-compose their original geometry. Solving this geometric re-assembly problem has direct applications in archaeology and forensic investigation in the computer-aided restoration of damaged artifacts and evidence. We develop a new algorithm to effectively integrate both guidance from a template and from(More)
Geometric restoration that composes 3D fragmented pieces into the original complete object is an important computer graphics and geometric processing problem. Automatic and effective restoration has applications in many fields such as archeological reconstruction, digital heritage archiving, forensic evidence processing, to name a few. For example,(More)
  • 1