Reducing complexity in polygonal meshes with view-based saliency
From MaRDI portal
Publication:2396281
Recommendations
- Mesh saliency via spectral processing
- scientific article; zbMATH DE number 2247682
- Quadratic error metric mesh simplification algorithm based on discrete curvature
- Extraction of Ridges-Valleys for Feature-Preserving Simplification of Polygonal Models
- Mesh simplification using an area-based distortion measure
Cites work
- A Mathematical Theory of Communication
- DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
- Divergence measures based on the Shannon entropy
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- On the convexity of some divergence measures based on entropy functions
Cited in
(5)- P^2: a robust and rotationally invariant shape descriptor with applications to mesh saliency
- Extraction of Ridges-Valleys for Feature-Preserving Simplification of Polygonal Models
- Mesh simplification algorithm based on screen resolution of mobile devices
- Mathematical Foundations of Computer Science 2004
- Mesh saliency via spectral processing
This page was built for publication: Reducing complexity in polygonal meshes with view-based saliency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2396281)