Generation of surface meshes remains an active research problem despite the many publications addressing this topic. The main issues which must be treated by a good remeshing algo...
Topology modification of hexahedral meshes has been considered difficult due to the propagation of topological modifications non-locally. We address this problem by working in the...
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia
In this paper we describe and discuss a new kernel design for geometric computation in the plane. It combines different kinds of floating-point filter techniques and a lazy eval...
In many applications one is concerned with the approximation of functions from a finite set of scattered data sites with associated function values. We describe a scheme for cons...