Visibility in Discrete Geometry: An Application to Discrete Geodesic Paths

Cœurjolly, David

doi:10.1007/3-540-45986-3_29

Search citation statements

Order By: Relevance

Paper Sections

Select...

About the Scan Process T1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2006

Publication Types

Select...

Book1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To implement this behaviour we use a priority queue Q. This method has originaly been proposed by Verwer et al [16] and first used by Coeurjolly on digital surfaces [17]. We start by pushing p into the queue with a weight equals to zero.…”

Section: About the Scan Process Tmentioning

confidence: 99%

Geometric Feature Estimators for Noisy Discrete Surfaces

Provot

Debled-Rennesson

Discrete Geometry for Computer Imagery

View full text Add to dashboard Cite

Abstract. We present in this paper robust geometric feature estimators on the border of a possibly noisy discrete object. We introduce the notion of patch centered at a point of this border. Thanks to a width parameter, attached to a patch, the noise on the border of the discrete object can be considered, and an extended flat neighborhood of a border point is computed. Stable geometric features are then extracted around this point. A normal vector estimator is proposed as well as a detector of convex and concave parts on the border of a discrete object.

show abstract

Section: About the Scan Process Tmentioning

confidence: 99%