Slicing an ear using prune-and-search

DOI10.1016/0167-8655(93)90141-YzbMath0781.68114WikidataQ56389439 ScholiaQ56389439MaRDI QIDQ4274653

Hossam ElGindy, Godfried T. Toussaint, Hazel Everett

Publication date: 2 January 1994

Published in: Pattern Recognition Letters (Search for Journal in Brave)

zbMATH Keywords

triangulationdiagonal

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

Memory-constrained algorithms for simple polygons ⋮ Reprint of: Memory-constrained algorithms for simple polygons ⋮ Area Optimal Polygonization Using Simulated Annealing ⋮ Построение интерактивной геометрической модели внешней поверхности космического аппарата ⋮ Orbiting triangle method for convex polygon triangulation ⋮ Probabilistic pursuits on graphs ⋮ Triangulation algorithms for generating as-is floor plans

This page was built for publication: Slicing an ear using prune-and-search