Efficient algorithms for constructing a pyramid from a terrain

DOI10.1007/B11261MaRDI QIDQ5897093zbMATH OpenOpenAlexFDO

Authors Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama

Publication date 5 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11261

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computing and Combinatorics
• Pyramid segmentation algorithms revisited
• scientific article; zbMATH DE number 2084487
• Computing convexity properties of images on a pyramid computer
• An Efficient Algorithm for Obtaining the Volume of a Special Kind of Pyramid and Application to Convex Polyhedra

Cited in

(1)

• Consistent digital rays

This page was built for publication: Efficient algorithms for constructing a pyramid from a terrain

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