Geometric data structures for computer graphics.

MaRDI QIDQ5479636zbMATH OpenFDO

Authors Elmar Langetepe, Gabriel Zachmann

Publication date 10 July 2006

zbMATH Keywords

robustnesscomputational geometryVoronoi diagramcomputer graphicskinetic data structuresdynamization of data structurestree data structures

Mathematics Subject Classification ID

Data structures (68P05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited in

(10)

• scientific article; zbMATH DE number 3988693 (Why is no real title available?)
• scientific article; zbMATH DE number 1306029 (Why is no real title available?)
• Towards in-place geometric algorithms and data structures
• scientific article; zbMATH DE number 5270757 (Why is no real title available?)
• scientific article; zbMATH DE number 4072225 (Why is no real title available?)
• A smoothed particle image reconstruction method
• Facial feature detection using distance vector fields
• Combinatorial maps. Efficient data structures for computer graphics and image processing
• Succinct and Implicit Data Structures for Computational Geometry
• Multiple point evaluation on combined tensor product supports

Describes a project that uses

Uses Software

• Hull
• Qsplat
• PARI/GP
• gmp
• CGAL

This page was built for publication: Geometric data structures for computer graphics.

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