scientific article; zbMATH DE number 1747707

DOI10.1002/1521-3870(200204)48:3%3C447::AID-MALQ447%3E3.0.CO;2-LMaRDI QIDQ4530156zbMATH OpenFDO

Authors Andreas Spillner, Hans-Dietrich Hecker

Publication date 29 May 2002

Full work available at URL https://doi.org/10.1002/1521-3870(200204)48:3%3C447::AID-MALQ447%3E3.0.CO;2-L

zbMATH Keywords

floodlightsillumination

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Illumination of polygons with vertex lights
• scientific article; zbMATH DE number 2162124
• Illuminating a convex polygon with vertex lights
• scientific article; zbMATH DE number 1728324
• Optimal simplification of polygonal chain for rendering
• Minimizing visible edges in polyhedra
• scientific article; zbMATH DE number 870140
• Polygon triangulation: Efficiency and minimality

Cites work

• Inferences on the Association Parameter in Copula Models for Bivariate Survival Data

Cited in

(1)

• scientific article; zbMATH DE number 2162124 (Why is no real title available?)

This page was built for publication:

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