The envelope of a digital curve based on dominant points

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1953 LNCS, Issue , 2000, Pages 453-463

  Singh, David E ^a   Martín, Martía J ^b   Rivera, Francisco F ^a  

^a UNIVERSITY OF SANTIAGO DE COMPOSTELA   (Spain)

^b UNIVERSITY OF A CORUÑA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DIGITAL STORAGE; GEOMETRY; OPTIMAL SYSTEMS;

DOMINANT POINTS; FOLLOWING PROBLEM; FREEMAN CHAIN CODE; GREEDY APPROXIMATION ALGORITHMS; LOWER COMPLEXITY; MEMORY REQUIREMENTS; OPTIMAL SOLUTIONS; PRE-PROCESSING; DIGITAL CURVE; SET OF LINES;

APPROXIMATION ALGORITHMS;

EID: 84884635244     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44438-6_37     Document Type: Conference Paper

References (12)

1. A. Aggarwal, J. Park: Notes on Searching in Multidimensional Monotone Arrays. Proc. 29th IEEE Symp. on Found. of Comp. Sci. (1988), 497-512 453
2. J. O'Rourke, A. Aggarwal, S. Maddial, M. Baldwin: An optimal algorithm for finding enclosing triangles. J. Algorithms, 7 (1986) 258-269 453
3. A. Aggarwal, J. Chang, C. Yap: Minimum Area Circumscribing Polygons. Visual Computer, 1 (1985), 112-117 453
4. A. DePano, A. Aggarwal: Finding restricted κ-envelopes for convex polygons. Proc. 22nd Allerton Conf. on Comm. Control and Computing, (1984) 81-90 453
5. DavidM. Mount, Ruth Silverman: Minimum enclosures with specified angles. Technical Report, CS-TR-3219 (1994) 453
6. J. G. Dunham: Optimum Uniform Piecewise Linear Approximation of Planar Curves. IEEE Trans. Pattern Anal. and Machine Intelligence, V. 8-1, (1986) 67-75 453
7. Paul L. Rosin: Techniques for Assessing polygonal approximations of curves. IEEE Trans. on Pattern Anal. and Machine Intelligence, Vol 19, No 6 (1997) 659-666 453
8. F. Attneave: Some informational aspects of visual perception. Psychol. Review. vol 61, no 3, (1954) 183-193 454
9. Mohan S. Kankanhalli: An adaptive dominant point detection algorithm for digital curves. Pattern Recognition Letters. 14 (1993) 385-390 454
10. Cho-Huak Teh, Roland T. Chin: On the detection of dominant points. IEEE Trans. on Pattern Anal. and Machine Intelligence. Vol 11. No 8 (1989) 859-872 454
11. Isabelle Debled-Rennesson, Jean-Pierre Reveillès: A linear algorithm for segmentation of digital curves. Int. J. of Pattern Recog. and Artificial Intelligence. 9-6 (1995) 454
12. David E. Singh, María J. Martín, Francisco F. Rivera: Propiedades geométricas en la obtención de la envolvente a una curva digital. Tech. report. (1999) 456, 457, 460, 461