Slicing an ear using prune-and-search
From MaRDI portal
Publication:4274653
DOI10.1016/0167-8655(93)90141-YzbMATH Open0781.68114WikidataQ56389439 ScholiaQ56389439MaRDI QIDQ4274653FDOQ4274653
Authors: Hossam ElGindy, Hazel Everett, Godfried Toussaint 
Publication date: 2 January 1994
Published in: Pattern Recognition Letters (Search for Journal in Brave)
Recommendations
- Ear-slicing and quality triangulation
- Prune-and-search with limited workspace
- Ear decomposition with bounds on ear length
- Ear-slicing for matchings in hypergraphs
- A theory of pruning
- scientific article; zbMATH DE number 1757963
- Pruning by isomorphism in branch-and-cut
- scientific article; zbMATH DE number 1574595
- A remark on the slicing problem
Cited In (8)
- Orbiting triangle method for convex polygon triangulation
- Memory-constrained algorithms for simple polygons
- Area optimal polygonization using simulated annealing
- Ear-slicing and quality triangulation
- Construction of interactive geometric model of outside surface of a spacecraft
- Triangulation algorithms for generating as-is floor plans
- Probabilistic pursuits on graphs
- Reprint of: Memory-constrained algorithms for simple polygons
This page was built for publication: Slicing an ear using prune-and-search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4274653)
