Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications
From MaRDI portal
Publication:5459124
DOI10.1007/11940128_30zbMATH Open1135.68606OpenAlexW1528889698WikidataQ42044672 ScholiaQ42044672MaRDI QIDQ5459124FDOQ5459124
Publication date: 24 April 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc4235662
Recommendations
- EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS
- THE LAYERED NET SURFACE PROBLEMS IN DISCRETE GEOMETRY AND MEDICAL IMAGE SEGMENTATION
- Algorithms and Computation
- EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
- scientific article; zbMATH DE number 2086692
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)
Cited In (10)
- The computational complexity of densest region detection
- Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
- Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem
- Title not available (Why is that?)
- EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS
- Regional surveillance of disjoint rectangles: a travelling salesman formulation
- Consistent digital rays
- Title not available (Why is that?)
- Algorithms and Computation
- Capacitive flows on a 2D random net
This page was built for publication: Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459124)