Optimization of triangular networks with spatial constraints

DOI10.1080/10556788.2019.1604703zbMATH Open1502.90127arXiv1811.04721OpenAlexW2951791943MaRDI QIDQ5085265FDOQ5085265

Authors: Valentin R. Koch, Hung M. Phan 

Publication date: 27 June 2022

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Abstract: A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy spatial constraints that are imposed either by observation from the real world, or by concrete design specifications of the object. As these problems tend to be of large scale, choosing a mathematical optimization approach can be particularly challenging. In this paper, we model various geometric constraints as convex sets in Euclidean spaces, and find the corresponding projections in closed forms. We also present an interesting idea to successfully maneuver around some important nonconvex constraints while still preserving the intrinsic nature of the original design problem. We then use these constructions in modern first-order splitting methods to find optimal solutions.

Full work available at URL: https://arxiv.org/abs/1811.04721

Recommendations

• Quading triangular meshes with certain topological constraints
• Geometric surface mesh optimization
• scientific article; zbMATH DE number 2087465
• Riemannian methods for optimization in a shape space of triangular meshes
• Maillage géométrique de surfaces

zbMATH Keywords

convex optimizationDouglas-Rachford splittingprojection methodsmaximum slopealignment constraintminimum slopeoriented slope

Mathematics Subject Classification ID

Convex programming (90C25) Convexity of real functions of several variables, generalizations (26B25) Decomposition methods (49M27) Convex functions and convex programs in convex geometry (52A41) Computer-aided design (modeling of curves and surfaces) (65D17)

Cites Work

• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• On Projection Algorithms for Solving Convex Feasibility Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonlinear optimization.
• Proximité et dualité dans un espace hilbertien
• Title not available (Why is that?)
• A monotone+skew splitting model for composite monotone inclusions in duality
• Iterative methods for fixed point problems in Hilbert spaces
• A primal-dual splitting algorithm for finding zeros of sums of maximal monotone operators
• Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces
• A proximal decomposition method for solving convex variational inverse problems
• On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
• Introduction to nonlinear optimization: theory, algorithms, and applications with MATLAB
• Convex analysis and monotone operator theory in Hilbert spaces
• Title not available (Why is that?)
• Solving the trust-region subproblem by a generalized eigenvalue problem
• Stadium norm and Douglas-Rachford splitting: a new approach to road design optimization

Cited In (3)

• Graph Drawing
• Triangle Finding and Listing in CONGEST Networks
• Overconstraint analysis on spatial 6-link loops

This page was built for publication: Optimization of triangular networks with spatial constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085265)