Geodesic methods in computer vision and graphics
This monograph reviews both the theory and practice of the numerical computation of
geodesic distances on Riemannian manifolds. The notion of Riemannian manifold allows …
geodesic distances on Riemannian manifolds. The notion of Riemannian manifold allows …
[PDF][PDF] Advances in studies and applications of centroidal Voronoi tessellations
Centroidal Voronoi tessellations (CVTs) have become a useful tool in many applications
ranging from geometric modeling, image and data analysis, and numerical partial differential …
ranging from geometric modeling, image and data analysis, and numerical partial differential …
PolyMesher: a general-purpose mesh generator for polygonal elements written in Matlab
We present a simple and robust Matlab code for polygonal mesh generation that relies on
an implicit description of the domain geometry. The mesh generator can provide, among …
an implicit description of the domain geometry. The mesh generator can provide, among …
Quad‐mesh generation and processing: A survey
Triangle meshes have been nearly ubiquitous in computer graphics, and a large body of
data structures and geometry processing algorithms based on them has been developed in …
data structures and geometry processing algorithms based on them has been developed in …
On centroidal Voronoi tessellation—energy smoothness and fast computation
Centroidal Voronoi tessellation (CVT) is a particular type of Voronoi tessellation that has
many applications in computational sciences and engineering, including computer graphics …
many applications in computational sciences and engineering, including computer graphics …
Pie-nerf: Physics-based interactive elastodynamics with nerf
We show that physics-based simulations can be seamlessly integrated with NeRF to
generate high-quality elastodynamics of real-world objects. Unlike existing methods we …
generate high-quality elastodynamics of real-world objects. Unlike existing methods we …
DARP: Divide areas algorithm for optimal multi-robot coverage path planning
This paper deals with the path planning problem of a team of mobile robots, in order to cover
an area of interest, with prior-defined obstacles. For the single robot case, also known as …
an area of interest, with prior-defined obstacles. For the single robot case, also known as …
Multirobot control using time-varying density functions
SG Lee, Y Diaz-Mercado… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
An approach is presented for influencing teams of robots by means of time-varying density
functions, representing rough references for where the robots should be located. A …
functions, representing rough references for where the robots should be located. A …
ReALE: a reconnection-based arbitrary-Lagrangian–Eulerian method
We present a new reconnection-based arbitrary-Lagrangian–Eulerian (ALE) method. The
main elements in a standard ALE simulation are an explicit Lagrangian phase in which the …
main elements in a standard ALE simulation are an explicit Lagrangian phase in which the …
Multi-robot collaborative dense scene reconstruction
We present an autonomous scanning approach which allows multiple robots to perform
collaborative scanning for dense 3D reconstruction of unknown indoor scenes. Our method …
collaborative scanning for dense 3D reconstruction of unknown indoor scenes. Our method …