Result 1 to 20 of 43 total
Faithful polygonal representation of the convex and concave parts of a digital curve. (English)
Pattern Recognition 44, No. 10-11, 2693-2700 (2011).
1
A near-linear time guaranteed algorithm for digital curve simplification under the Fréchet distance. (English)
Debled-Rennesson, Isabelle (ed.) et al., Discrete geometry for computer imagery. 16th IAPR international conference, DGCI 2011, Nancy, France, April 6‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19866-3/pbk). Lecture Notes in Computer Science 6607, 333-345 (2011).
2
A near-linear time guaranteed algorithm for digital curve simplification under the Fréchet distance (English)
DGCI, 333-345 (2011).
3
Measure of circularity for parts of digital boundaries and its fast computation. (English)
Pattern Recognition 43, No. 1, 37-46 (2010).
4
Hierarchical discrete medial axis for sphere-tree construction. (English)
Wiederhold, Petra (ed.) et al., Combinatorial image analysis. 13th international workshop, IWCIA 2009, Playa del Carmen, Mexico, November 24‒27, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10208-0/pbk). Lecture Notes in Computer Science 5852, 56-67 (2009).
5
What does digital straightness tell about digital convexity? (English)
Wiederhold, Petra (ed.) et al., Combinatorial image analysis. 13th international workshop, IWCIA 2009, Playa del Carmen, Mexico, November 24‒27, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10208-0/pbk). Lecture Notes in Computer Science 5852, 43-55 (2009).
6
On three constrained versions of the digital circular arc recognition problem. (English)
Brlek, Srečko (ed.) et al., Discrete geometry for computer imagery. 15th IAPR international conference, DGCI 2009, Montréal, Canada, September 30‒October 2, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04396-3/pbk). Lecture Notes in Computer Science 5810, 34-45 (2009).
7
Special issue: DGCI 2008. Selected papers from the 14th International Association of Pattern Recognition (IAPR) international conference on discrete geometry for computer imagery (DGCI 2008), Lyon, France, April 16‒18, 2008. (English)
Pattern Recognition 42, No. 10, 2219-2326 (2009).
8
Minimum decomposition of a digital surface into digital plane segments is NP-hard. (English)
Discrete Appl. Math. 157, No. 3, 558-570 (2009).
9
Automatic computation of pebble roundness using digital imagery and discrete geometry (English)
Computers & Geosciences 35, No. 10, 1992-2000 (2009).
10
Introduction (English)
Computers & Graphics 33, No. 1, 1 (2009).
11
Hierarchical discrete medial axis for sphere-tree construction (English)
IWCIA, 56-67 (2009).
12
What does digital straightness tell about digital convexity? (English)
IWCIA, 43-55 (2009).
13
On three constrained versions of the digital circular arc recognition problem (English)
DGCI, 34-45 (2009).
14
Finding a minimum medial axis of a discrete shape is NP-hard. (English)
Theor. Comput. Sci. 406, No. 1-2, 72-79 (2008).
15
Discrete geometry for computer imagery. 14th IAPR international conference, DGCI 2008, Lyon, France, April 16‒18, 2008. Proceedings. (English)
Lecture Notes in Computer Science 4992. Berlin: Springer (ISBN 978-3-540-79125-6/pbk). xiii, 554~p. EUR~72.76 (2008).
16
Test and measure of circularity for digital curves (English)
IPCV, 518-524 (2008).
17
Robust decomposition of a digital curve into convex and concave parts (English)
ICPR, 1-4 (2008).
18
Computation of binary objects sides number using discrete geometry, application to automatic pebbles shape analysis (English)
ICIAP, 763-768 (2007).
19
Minimal decomposition of a digital surface into digital plane segments is NP-hard. (English)
Kuba, Attila (ed.) et al., Discrete geometry for computer imagery. 13th international conference, DGCI 2006, Szeged, Hungary, October 25‒27, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-47651-1/pbk). Lecture Notes in Computer Science 4245, 674-685 (2006).
20
Result 1 to 20 of 43 total
Start
Contact
Print
General Help
