We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...
Berk Geveci, Mathieu Malaterre, William J. Schroed...
Road network data is often incomplete, making it hard to perform network analysis. This paper discusses the problem of extending partial road networks with reasonable links, using...
Boris Aronov, Kevin Buchin, Maike Buchin, B. Janse...
We present a method for hierarchical data approximation using curved quadratic simplicial elements for domain decomposition. Scientific data defined over two- or three-dimensional ...
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
We reconstruct pipe-shaped objects from a set of contours, each of which is extracted from an image representing a slice sampled from 3D volume data. The contours are formed by con...