Geodesic methods in computer vision and graphics

G Peyré, M Péchaud, R Keriven… - … and Trends® in …, 2010 - nowpublishers.com
This monograph reviews both the theory and practice of the numerical computation of
geodesic distances on Riemannian manifolds. The notion of Riemannian manifold allows …

[PDF][PDF] Advances in studies and applications of centroidal Voronoi tessellations

Q Du, M Gunzburger, L Ju - Numerical Mathematics: Theory, Methods …, 2010 - global-sci.com
Centroidal Voronoi tessellations (CVTs) have become a useful tool in many applications
ranging from geometric modeling, image and data analysis, and numerical partial differential …

PolyMesher: a general-purpose mesh generator for polygonal elements written in Matlab

C Talischi, GH Paulino, A Pereira… - Structural and …, 2012 - Springer
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 …

Quad‐mesh generation and processing: A survey

D Bommes, B Lévy, N Pietroni, E Puppo… - Computer graphics …, 2013 - Wiley Online Library
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 …

On centroidal Voronoi tessellation—energy smoothness and fast computation

Y Liu, W Wang, B Lévy, F Sun, DM Yan, L Lu… - ACM Transactions on …, 2009 - dl.acm.org
Centroidal Voronoi tessellation (CVT) is a particular type of Voronoi tessellation that has
many applications in computational sciences and engineering, including computer graphics …

Pie-nerf: Physics-based interactive elastodynamics with nerf

Y Feng, Y Shang, X Li, T Shao… - Proceedings of the …, 2024 - openaccess.thecvf.com
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 …

DARP: Divide areas algorithm for optimal multi-robot coverage path planning

AC Kapoutsis, SA Chatzichristofis… - Journal of Intelligent & …, 2017 - Springer
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 …

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 …

ReALE: a reconnection-based arbitrary-Lagrangian–Eulerian method

R Loubere, PH Maire, M Shashkov, J Breil… - Journal of Computational …, 2010 - Elsevier
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 …

Multi-robot collaborative dense scene reconstruction

S Dong, K Xu, Q Zhou, A Tagliasacchi, S Xin… - ACM Transactions on …, 2019 - dl.acm.org
We present an autonomous scanning approach which allows multiple robots to perform
collaborative scanning for dense 3D reconstruction of unknown indoor scenes. Our method …