Practical Mixed-Integer Optimization for Geometry Processing
From MaRDI portal
Recommendations
- Optimization algorithms for faster computational geometry
- scientific article; zbMATH DE number 3974683
- scientific article; zbMATH DE number 1444288
- Polyhedral approximation in mixed-integer convex optimization
- Optimization approach for solving some geometry problems
- Multi-core Implementations of Geometric Algorithms
- Instance-optimal geometric algorithms
- scientific article; zbMATH DE number 4174695
Cited in
(15)- Towards an automatic isogeometric analysis suitable trivariate models generation -- application to geometric parametric analysis
- Atom simplification and quality T-mesh generation for multi-resolution biomolecular surfaces
- An Approach to Quad Meshing Based on Harmonic Cross-Valued Maps and the Ginzburg--Landau Theory
- Dual Surface Based Approach to Block Decomposition of Solid Models
- Discrete derivatives of vector fields on surfaces -- an operator approach
- Stripe patterns on surfaces
- Intrinsic mixed-integer polycubes for hexahedral meshing
- Integer-grid maps for reliable quad meshing
- 2.5D hexahedral meshing for reservoir simulations
- A variational method for generating \(n\)-cross fields using higher-order \(Q\)-tensors
- Bendfields, regularized curvature fields from rough concept sketches
- A splitting scheme for flip-free distortion energies
- A Hybrid Approach to Fast Indirect Quadrilateral Mesh Generation
- Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization
- Towards untrimmed NURBS: CAD embedded reparameterization of trimmed B-rep geometry using frame-field guided global parameterization
This page was built for publication: Practical Mixed-Integer Optimization for Geometry Processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3111679)