collaborators

6 papers

cs.GR2026

Dual Contouring of Signed Distance Data

Xiana Carrera, Ningna Wang, Christopher Batty +2

We propose an algorithm to reconstruct explicit polygonal meshes from discretely sampled Signed Distance Function (SDF) data, which is especially effective at recovering sharp feat…

cs.GR2026

SpUDD: Superpower Contouring of Unsigned Distance Data

Ningna Wang, Xiana Carrera, Christopher Batty +2

Unsigned distance functions offer a powerful and flexible implicit surface representation that, unlike their signed counterparts, allow for surfaces that are open, non-orientable,…

cs.GR2026

Greed for the Spheres: A Signed Distance Interpolation Method

Letao Chen, Sanju Mupparaju, Christopher Batty +2

We propose a method to interpolate Signed Distance Function (SDF) data from a discrete set of samples. Unlike prior work, our approach ensures that the new SDF data values are full…

cs.GR2026

MeshOn: Intersection-Free Mesh-to-Mesh Composition

Hyunwoo Kim, Itai Lang, Hadar Averbuch-Elor +2

We propose MeshOn, a method that finds physically and semantically realistic compositions of two input meshes. Given an accessory, a base mesh with a user-defined target region, an…

cs.GR2026

VoroUDF: Meshing Unsigned Distance Fields with Voronoi Optimization

Ningna Wang, Zilong Wang, Xiana Carrera +2

We present VoroUDF, an algorithm for reconstructing high-quality triangle meshes from Unsigned Distance Fields (UDFs). Our algorithm supports non-manifold geometry, sharp features,…

cs.GR2024

Mesh Simplification For Unfolding

Manas Bhargava, Camille Schreck, Marco Freire +4

We present a computational approach for unfolding 3D shapes isometrically into the plane as a single patch without overlapping triangles. This is a hard, sometimes impossible, prob…