Convex and Concave Vertices on a Simple Closed Curve in the Triangular Grid
From MaRDI portal
Publication:5237085
DOI10.1007/978-3-030-14085-4_31OpenAlexW2916125750MaRDI QIDQ5237085
Publication date: 16 October 2019
Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-14085-4_31
triangular griddigital topologysimple closed curveconvex and concave verticessalient and reentrant vertices
Cites Work
- Unnamed Item
- Unnamed Item
- Topology preservation on the triangular grid
- Cellular topology and topological coordinate systems on the hexagonal and on the triangular grids
- A linear-time algorithm to compute the triangular hull of a digital object
- On topology preservation of mixed operators in triangular, square, and hexagonal grids
- Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid
- Dimensional properties of graphs and digital spaces.
- On the tiling by translation problem
- Salient and reentrant points of discrete sets
- Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods
- Salient and Reentrant Points of Discrete Sets
- Algorithm for Generating a Digital Straight Line on a Triangular Grid
- Angle counts for isothetic polygons and polyhedra
- Finding Shortest Triangular Path and its Family inside a Digital Object
- Dense Projection Tomography on the Triangular Tiling
- Developments in Language Theory
- PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS
- Local Properties of Binary Images in Two Dimensions
- Gaps and well-composed objects in the triangular grid
This page was built for publication: Convex and Concave Vertices on a Simple Closed Curve in the Triangular Grid
