Curvature and Flow in Digital Space
From MaRDI portal
Publication:4682468
DOI10.5802/acirm.67zbMath1464.68415OpenAlexW2331419754MaRDI QIDQ4682468
Publication date: 18 September 2018
Published in: Actes des rencontres du CIRM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5802/acirm.67
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects of digital topology (68U03)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal roughness property of the Delaunay triangulation
- Flow by mean curvature of convex surfaces into spheres
- A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form
- A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form
- A recursive sweep-plane algorithm, determining all cells of a finite division of \(R^ m\).
- Scale selection properties of generalized scale-space interest point detectors
- Data Dependent Triangulations for Piecewise Linear Interpolation
- Algorithms for the euler characteristic and related additive functionals of digital objects
- An Introduction to Symbolic Dynamics and Coding
- Cellular Automata Modeling of Physical Systems
- Fundamentals of Three-Dimensional Digital Image Processing
- Discrete Geometry for Computer Imagery