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 …
[HTML][HTML] Digital fabrication of ribbed concrete shells using automated robotic concrete spraying
Doubly-curved ribbed concrete shells are a materially efficient means of spanning large
areas such as roofs and floors. However, the fabrication of such structures poses challenges …
areas such as roofs and floors. However, the fabrication of such structures poses challenges …
G2l: Semantically aligned and uniform video grounding via geodesic and game theory
H Li, M Cao, X Cheng, Y Li, Z Zhu… - Proceedings of the …, 2023 - openaccess.thecvf.com
The recent video grounding works attempt to introduce vanilla contrastive learning into video
grounding. However, we claim that this naive solution is suboptimal. Contrastive learning …
grounding. However, we claim that this naive solution is suboptimal. Contrastive learning …
Registration of 3D point clouds and meshes: A survey from rigid to nonrigid
Three-dimensional surface registration transforms multiple three-dimensional data sets into
the same coordinate system so as to align overlapping components of these sets. Recent …
the same coordinate system so as to align overlapping components of these sets. Recent …
Geodesics in heat: A new approach to computing distance based on heat flow
K Crane, C Weischedel, M Wardetzky - ACM Transactions on Graphics …, 2013 - dl.acm.org
We introduce the heat method for computing the geodesic distance to a specified subset (eg,
point or curve) of a given domain. The heat method is robust, efficient, and simple to …
point or curve) of a given domain. The heat method is robust, efficient, and simple to …
A laplacian for nonmanifold triangle meshes
N Sharp, K Crane - Computer Graphics Forum, 2020 - Wiley Online Library
We describe a discrete Laplacian suitable for any triangle mesh, including those that are
nonmanifold or nonorientable (with or without boundary). Our Laplacian is a robust drop‐in …
nonmanifold or nonorientable (with or without boundary). Our Laplacian is a robust drop‐in …
A machine learning approach to investigate the relationship between shape features and numerically predicted risk of ascending aortic aneurysm
Geometric features of the aorta are linked to patient risk of rupture in the clinical decision to
electively repair an ascending aortic aneurysm (AsAA). Previous approaches have focused …
electively repair an ascending aortic aneurysm (AsAA). Previous approaches have focused …
Model order reduction assisted by deep neural networks (ROM-net)
In this paper, we propose a general framework for projection-based model order reduction
assisted by deep neural networks. The proposed methodology, called ROM-net, consists in …
assisted by deep neural networks. The proposed methodology, called ROM-net, consists in …
Shortest paths and networks
JSB Mitchell - Handbook of discrete and computational …, 2017 - api.taylorfrancis.com
Handbook of DISCRETE AND COMPUTATIONAL GEOMETRY Page 1 i “K25063” — 2017/9/15
— 18:58 — page 811 — i i i 31 SHORTEST PATHS AND NETWORKS Joseph SB Mitchell …
— 18:58 — page 811 — i i i 31 SHORTEST PATHS AND NETWORKS Joseph SB Mitchell …
A robust hole-filling algorithm for triangular mesh
This paper presents a novel hole-filling algorithm that can fill arbitrary holes in triangular
mesh models. First, the advancing front mesh technique is used to cover the hole with newly …
mesh models. First, the advancing front mesh technique is used to cover the hole with newly …