Digital topology on adaptive octree grids
From MaRDI portal
Publication:993527
DOI10.1007/S10851-009-0140-7zbMATH Open1490.68255OpenAlexW2069426569WikidataQ39914883 ScholiaQ39914883MaRDI QIDQ993527FDOQ993527
Authors: Ying Bai, Xiao Han, Jerry L. Prince
Publication date: 20 September 2010
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc2805029
Recommendations
Computing methodologies for image processing (68U10) Computational aspects of digital topology (68U03)
Cites Work
- Title not available (Why is that?)
- Efficient algorithms for globally optimal trajectories
- A fast marching level set method for monotonically advancing fronts.
- An adaptive level set method for medical image segmentation
- Connectivity in Digital Pictures
- Computer graphics and connected topologies on finite ordered sets
- Homotopy in digital spaces
- Title not available (Why is that?)
- Geometry of digital spaces
- Axiomatic digital topology
- A concise characterization of 3D simple points
- A new characterization of three-dimensional simple points
- Arcs and Curves in Digital Pictures
- Topological adjacency relations on \(Z^{n}\)
- A topology-preserving parallel 3D thinning algorithm for extracting the curve skeleton.
- Title not available (Why is that?)
- If we use 4- or 8-connectedness for both the objects and the background, the Euler characteristics is not locally computable
Cited In (5)
This page was built for publication: Digital topology on adaptive octree grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q993527)