Summary
Motivated by practical numerical issues in a number of modeling and simulation problems, we introduce the notion of a compatible dual complex to a primal triangulation, such that a simplicial mesh and its compatible dual complex (made out of convex cells) form what we call a primal-dual triangulation. Using algebraic and computational geometry results, we show that compatible dual complexes exist only for a particular type of triangulation known as weakly regular. We also demonstrate that the entire space of primal-dual triangulations, which extends the well known (weighted) Delaunay/Voronoi duality, has a convenient, geometric parametrization. We finally discuss how this parametrization may play an important role in discrete optimization problems such as optimal mesh generation, as it allows us to easily explore the space of primal-dual structures along with some important subspaces.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alliez, P., Cohen-Steiner, D., Yvinec, M., Desbrun, M.: Variational tetrahedral meshing. In: ACM SIGGRAPH 2005 Courses (2005)
Aurenhammer, F.: A criterion for the affine equivalence of cell complexes in ℝd and convex polyhedra in ℝd + 1. Discrete and Computational Geometry 2(1), 49–64 (1987)
Aurenhammer, F.: Recognising polytopical cell complexes and constructing projection polyhedra. Journal of Symbolic Computation 3(3), 249–255 (1987)
Banchoff, T.F.: Beyond the Third Dimension: Geometry, Computer Graphics, and Higher Dimensions. W.H. Freeman (1990)
Bossavit, A.: Computational Electromagnetism. Academic Press, Boston (1998)
Baligaa, B.R., Patankarb, S.V.: A Control Volume Finite-Element Method For Two-Dimensional Fluid Flow And Heat Transfer. Numerical Heat Transfer 6, 245–261 (1983)
Cheng, S.-W., Dey, T.K., Levine, J.: Theory of a practical Delaunay meshing algorithm for a large class of domains. In: Bhattacharya, B., et al. (eds.) Algorithms, Architecture and Information Systems Security, World Scientific Review, vol. 3, pp. 17–41 (2008)
Connelly, R., Henderson, D.W.: A convex 3-complex not simplicially isomorphic to a strictly convex complex. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol. 88, pp. 299–306. Cambridge Univ. Press (1980)
Desbrun, M., Kanso, E., Tong, Y.: Discrete differential forms for computational modeling. In: Bobenko, A., Schröder, P. (eds.) Discrete Differential Geometry. Springer, Heidelberg (2007)
De Loera, J.A., Rambau, J., Santos, F.: Triangulations: Applications, Structures and Algorithms. In: Algorithms and Computation in Mathematics. Springer, Heidelberg (to appear)
Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Heidelberg (1987)
Edelsbrunner, H., Seidel, R.: Voronoi diagrams and arrangements. Discrete Comput. Geom. 1, 25–44 (1986)
Ewald, G.: Combinatorial convexity and algebraic geometry. Springer, Heidelberg (1996)
Fisher, M., Springborn, B., Bobenko, A.I., Schröder, P.: An algorithm for the construction of intrinsic delaunay triangulations with applications to digital geometry processing. In: ACM SIGGRAPH Courses, pp. 69–74 (2006)
Gelfand, I.M., Kapranov, M.M., Zelevinsky, A.V.: Discriminants, resultants, and multidimensional determinants. Springer, Heidelberg (1994)
Glickenstein, D.: Geometric triangulations and discrete Laplacians on manifolds. Arxiv preprint math/0508188 (2005)
Grady, L.J., Polimeni, J.R.: Discrete Calculus: Applied Analysis on Graphs for Computational Science. Springer, Heidelberg (2010)
Grünbaum, B.: Convex polytopes. Springer, Heidelberg (2003)
Lee, C.W.: Regular triangulations of convex polytopes. In: Gritzmann, P., Sturmfels, B. (eds.) Applied Geometry and Discrete Mathematics–The Victor Klee Festschrift. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Amer. Math. Soc., vol. 4, pp. 443–456 (1991)
Liu, Y., Wang, W., Lévy, B., Sun, F., Yan, D.M., Lu, L., Yang, C.: On centroidal voronoi tessellation energy smoothness and fast computation. ACM Transactions on Graphics (TOG) 28(4), 1–17 (2009)
McCormick, S.F.: Multilevel Adaptive Methods for Partial Differential Equations. SIAM (1989)
Mjolsness, E.: The Growth and Development of Some Recent Plant Models: A Viewpoint. Journal of Plant Growth Regulation 25(4), 270–277 (2006)
Mullen, P., Memari, P., de Goes, F., Desbrun, M.: HOT: Hodge-Optimized Triangulations. ACM Trans. Graph. 30(4), 103:1–103:12 (2011)
Musin, O.R.: Properties of the Delaunay triangulation. In: Proceedings of the Thirteenth Annual Symposium on Computational Geometry, p. 426. ACM (1997)
Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial tessellations: Concepts and applications of Voronoi diagrams. In: Probability and Statistics, 2nd edn. Wiley (2000)
Paluszny, A., Matthäi, S., Hohmeyer, M.: Hybrid finite element finite volume discretization of complex geologic structures and a new simulation workflow demonstrated on fractured rocks. Geofluids 7, 186–208 (2007)
Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)
Rajan, V.T.: Optimality of the Delaunay triangulation in ℝd. Discrete and Computational Geometry 12(1), 189–202 (1994)
Richter-Gebert, J.: Realization spaces of polytopes. Citeseer (1996)
Schwartz, A.: Constructions of cubical polytopes. PhD diss., TU Berlin (2003)
Shah, N.R.: A parallel algorithm for constructing projection polyhedra. Information Processing Letters 48(3), 113–119 (1993)
Steinitz, E.: Polyeder und raumeinteilungen. Encyclopädie der mathematischen Wissenschaften 3(9), 1–139 (1922)
Thomas, R.R.: Lectures in geometric combinatorics. Amer. Mathematical Society (2006)
Tournois, J., Wormser, C., Alliez, P., Desbrun, M.: Interleaving delaunay refinement and optimization for practical isotropic tetrahedron mesh generation. ACM Trans. Graph. 28, 75:1–75:9 (2009)
Ziegler, G.M.: Lectures on polytopes. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Memari, P., Mullen, P., Desbrun, M. (2011). Parametrization of Generalized Primal-Dual Triangulations. In: Quadros, W.R. (eds) Proceedings of the 20th International Meshing Roundtable. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24734-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-24734-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24733-0
Online ISBN: 978-3-642-24734-7
eBook Packages: EngineeringEngineering (R0)