Near-Regular Structure Discovery Using Linear Programming

DOI10.1145/2535596zbMATH Open1322.68224OpenAlexW2040252560MaRDI QIDQ5176491FDOQ5176491

Authors: Qi-Xing Huang, Niloy J. Mitra, Leonidas Guibas 

Publication date: 26 February 2015

Published in: ACM Transactions on Graphics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2535596

Recommendations

• Finding common structured patterns in linear graphs
• Pattern Search Methods for Linearly Constrained Minimization
• Detecting a data set structure through the use of nonlinear projections search and optimization
• Structure Detection in Mixed-Integer Programs
• An algorithm for solving a structured class of linear programming problems
• Linear algorithm for minimal rearrangement of structures
• A domain decomposition strategy to efficiently solve structures containing repeated patterns

zbMATH Keywords

linear programminginteger programmingintrinsic near-regular structuremarkerless correspondencepattern manipulation

Mathematics Subject Classification ID

Convex programming (90C25) Pattern recognition, speech recognition (68T10) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Integer programming (90C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Title not available (Why is that?)
• Computational topology. An introduction
• Title not available (Why is that?)
• Mean value coordinates
• Numerical Geometry of Non-Rigid Shapes
• Segmenting Periodic Reliefs on Triangle Meshes
• Constructing Regularity Feature Trees for Solid Models

Uses Software

• CVX
• SCAPE

This page was built for publication: Near-Regular Structure Discovery Using Linear Programming

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