We introduce Hodge-optimized triangulations (HOT), a family of well-shaped primal-dual pairs of complexes designed for fast and accurate computations in computer graphics. Previous work most commonly employs barycentric or circumcentric duals; while barycentric duals guarantee that the dual of each simplex lies within the simplex, circumcentric duals are often preferred due to the induced orthogonality between primal and dual complexes. We instead promote the use of weighted duals ("power diagrams"). They allow greater flexibility in the location of dual vertices while keeping primal-dual orthogonality, thus providing a valuable extension to the usual choices of dual by only adding one additional scalar per primal vertex. Furthermore, we in...
We survey the computational geometry relevant to nite element mesh generation. We especially focus o...
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for in...
We present a method for contouring an implicit function using a grid topologically dual to structure...
We introduce Hodge-optimized triangulations (HOT), a family of well-shaped primal-dual pairs of comp...
We propose primal-dual mesh optimization algorithms that overcome shortcomings of the standard algor...
Hodge-optimized triangulations (HOT) can optimize the dual mesh alone or both the primal and dual me...
Triangle meshes have found widespread acceptance in computer graphics as a simple, convenient, and v...
Triangle meshes have found widespread acceptance in computer graphics as a simple, convenient, and v...
Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagra...
We consider the solution of electromagnetic problems. A mainly orthogonal and locally barycentric du...
Well-centered meshes (meshes composed of well-centered simplices) have the advantage of having nice ...
International audience<p>In this paper, we investigate weighted triangulations as discrete, augmente...
This thesis introduces new tools for geometric discretization in computer graphics and computational...
We prove that the dual of the digital Voronoi diagram constructed by flooding the plane from the dat...
In this paper, we begin by defining and examining the properties of a Voronoi diagram and extend it ...
We survey the computational geometry relevant to nite element mesh generation. We especially focus o...
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for in...
We present a method for contouring an implicit function using a grid topologically dual to structure...
We introduce Hodge-optimized triangulations (HOT), a family of well-shaped primal-dual pairs of comp...
We propose primal-dual mesh optimization algorithms that overcome shortcomings of the standard algor...
Hodge-optimized triangulations (HOT) can optimize the dual mesh alone or both the primal and dual me...
Triangle meshes have found widespread acceptance in computer graphics as a simple, convenient, and v...
Triangle meshes have found widespread acceptance in computer graphics as a simple, convenient, and v...
Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagra...
We consider the solution of electromagnetic problems. A mainly orthogonal and locally barycentric du...
Well-centered meshes (meshes composed of well-centered simplices) have the advantage of having nice ...
International audience<p>In this paper, we investigate weighted triangulations as discrete, augmente...
This thesis introduces new tools for geometric discretization in computer graphics and computational...
We prove that the dual of the digital Voronoi diagram constructed by flooding the plane from the dat...
In this paper, we begin by defining and examining the properties of a Voronoi diagram and extend it ...
We survey the computational geometry relevant to nite element mesh generation. We especially focus o...
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for in...
We present a method for contouring an implicit function using a grid topologically dual to structure...