Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes

DOI10.1007/978-3-642-10631-6_117MaRDI QIDQ3652301zbMATH OpenOpenAlexFDO

Authors Jinhee Chun, Ryosei Kasai, Takeshi Tokuyama, Matias Korman

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_117

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On maximum weight objects decomposable into based rectilinear convex objects
• A greedy algorithm for decomposing convex structuring elements
• EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS
• Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications
• scientific article; zbMATH DE number 4211553
• The weighted region problem
• An optimal algorithm for extracting the regions of a plane graph
• Algorithms for problems on maximum density segment
• New algorithms for maximum weight matching and a decomposition theorem

Cited in

(8)

• scientific article; zbMATH DE number 11347 (Why is no real title available?)
• scientific article; zbMATH DE number 480527 (Why is no real title available?)
• Base-object location problems for base-monotone regions
• On maximum weight objects decomposable into based rectilinear convex objects
• Shape decomposition algorithms for laser capture microdissection
• Maximum weight digital regions decomposable into digital star-shaped regions
• scientific article; zbMATH DE number 5347083 (Why is no real title available?)
• Computing regions decomposable into \(m\) stars

This page was built for publication: Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes

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