2018
DOI: 10.1049/iet-ipr.2017.0598
|View full text |Cite
|
Sign up to set email alerts
|

Efficient 3D mesh salient region detection using local homogeneity measure

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…To define the neighboring set 𝐷 𝑛 (𝑣 𝑖 ) of a given vertex, we use the concept of Delaunay triangulation [10]. For a given 3D surface point represented by a graph vertex 𝑣 𝑖 , we construct circumscribed spheres that do not contain any other surface points inside them.…”
Section: A Surface Modeling and Normal Estimationmentioning
confidence: 99%
See 1 more Smart Citation
“…To define the neighboring set 𝐷 𝑛 (𝑣 𝑖 ) of a given vertex, we use the concept of Delaunay triangulation [10]. For a given 3D surface point represented by a graph vertex 𝑣 𝑖 , we construct circumscribed spheres that do not contain any other surface points inside them.…”
Section: A Surface Modeling and Normal Estimationmentioning
confidence: 99%
“…In this paper, we propose a robust curve-skeleton extraction method for 3D objects. We construct a Delaunay graph [10] from the initial data to ensure an efficient neighboring modeling relation. Then, we use a heuristic algorithm to compute discrete contours and construct spiral patches for vertices, representing the shortest self-loop from the vertex over the contour.…”
Section: Introductionmentioning
confidence: 99%