6.4.2.2 Polygonal Representations from Curves

Nagy, G.[George], Wagle, S.G.[Sharad G.],
Approximation of polygonal maps by cellular maps,
CACM(22), No. 9, September 1979, pp. 518-525.
WWW Version. BibRef 7909

Sklansky, J.[Jack], Gonzalez, V.[Victor],
Fast polygonal approximation of digitized curves,
PR(12), No. 5, 1980, pp. 327-331.
WWW Version. 0309 BibRef

Rosin, P.L.,
Techniques for Assessing Polygonal Approximations of Curves,
PAMI(19), No. 6, June 1997, pp. 659-666.
IEEE Abstract. IEEE Top Reference.
WWW Version. 9708 BibRef
Earlier: BMVC96(Poster Session 1). 9608 BibRef
And: Technical ReportCSTR-96-3, February 1996, Brunel University, UK.
Postscript Version. Evaluation. Brunel University. Presents the comparison of results of 23 algorithms on a test curve. And an evaluation criteria. Start here for viable techniques. BibRef

Rosin, P.L.[Paul L.],
Assessing the Behaviour of Polygonal Approximation Algorithms,
PR(36), No. 2, February 2003, pp. 505-518.
WWW Version. 0211 BibRef
Earlier: BMVC98(xx-yy). Continuation from See also Techniques for Assessing Polygonal Approximations of Curves. to assess stability under variations in scale parameters and data. BibRef

Sklansky, J., Chazin, R.L., and Hansen, B.J.,
Minimum Perimeter Polygons of Digitized Silhouettes,
TC(21), No. 3, March 1972, pp. 260-268. BibRef 7203

Sklansky, J., Nahin, P.J.,
A Parallel Mechanism for Describing Silhouettes,
TC(21), No. 11, November 1972, pp. 1233-1239. BibRef 7211

Nahin, P.J.[Paul J.],
The theory and measurement of a silhouette descriptor for image pre-processing and recognition,
PR(6), No. 2, October 1974, pp. 85-95.
WWW Version. 0309 BibRef

Kurozumi, Y., and Davis, W.A.,
Polygonal Approximation by the Minimax Method,
CGIP(19), No. 3, July 1982, pp. 248-264.
WWW Version. BibRef 8207

Sarvarayudu, G.P.R., Sethi, I.K.,
Walsh Descriptors for Polygonal Curves,
PR(16), No. 3, 1983, pp. 327-336.
WWW Version. BibRef 8300
Earlier:
Boundary Approximation Using Walsh Series Expansion for Numeral Recognition,
ICPR80(879-881). BibRef

Wall, K., Danielsson, P.E.,
A Fast Sequential Method for Polygonal Approximation of Digitized Curves,
CVGIP(28), No. 2, November 1984, pp. 220-227.
WWW Version. BibRef 8411

Wall, K.,
Curve Fitting Based On Polygonal Approximation,
ICPR86(1273-1275). BibRef 8600

Imai, H., Iri, M.,
Computational-Geometric Methods for Polygonal Approximations of a Curve,
CVGIP(36), No. 1, October 1986, pp. 31-41.
WWW Version. BibRef 8610

Wu, W.Y.[Wen-Yen], Wang, M.J.J.[Mao-Jiun J.],
Detecting the Dominant Points by the Curvature-Based Polygonal Approximation,
GMIP(55), No. 2, March 1993, pp. 79-88. BibRef 9303

Pikaz, A., Dinstein, I.H.,
Using Simple Decomposition for Smoothing and Feature Point Detection Of Noisy Digital Curves,
PAMI(16), No. 8, August 1994, pp. 808-813.
IEEE Abstract. IEEE Top Reference.
WWW Version. BibRef 9408

Pikaz, A., Dinstein, I.,
Optimal Polygonal-Approximation of Digital Curves,
PR(28), No. 3, March 1995, pp. 373-379. BibRef 9503
Earlier:
WWW Version. ICPR94(A:619-621).
IEEE DOI may work or IEEE-CS DOI may work. BibRef

Perez, J.C., Vidal, E.,
Optimum Polygonal-Approximation Of Digitized-Curves,
PRL(15), No. 8, August 1994, pp. 743-750. BibRef 9408
Earlier:
An algorithm for the optimum piecewise linear approximation of digitized curves,
ICPR92(III:167-170).
IEEE DOI may work or IEEE-CS DOI may work. 9208 BibRef

Eu, D., Toussaint, G.T.,
On Approximating Polygonal Curves in 2 and 3 Dimensions,
GMIP(56), No. 3, May 1994, pp. 231-246. BibRef 9405

Chung, P.C., Tsai, C.T., Chen, E.L., Sun, Y.N.,
Polygonal-Approximation Using A Competitive Hopfield Neural-Network,
PR(27), No. 11, November 1994, pp. 1505-1512.
WWW Version. BibRef 9411

Ray, B.K., Ray, K.S.,
A New Approach to Polygonal Approximation,
PRL(12), 1991, pp. 229-234. See also New Split-and-Merge Technique for Polygonal-Approximation of Chain Coded Curves, A. See also Corner Detection Using Iterative Gaussian Smoothing with Constant Window Size. BibRef 9100

Ray, B.K., Ray, K.S.,
Determination of Optimal Polygon from Digital Curve Using L1 Norm,
PR(26), No. 4, April 1993, pp. 505-509.
WWW Version. BibRef 9304

Ray, B.K., Ray, K.S.,
A Nonparametric Sequential Method for Polygonal-Approximation of Digital Curves,
PRL(15), No. 2, February 1994, pp. 161-167. BibRef 9402

Ray, B.K., Ray, K.S.,
Detection of Significant Points and Polygonal Approximation of Digitized Curves,
PRL(13), 1992, pp. 443-452. BibRef 9200

Ray, B.K., Ray, K.S.,
An Algorithm for Polygonal Approximation of Digitized Curves,
PRL(13), 1992, pp. 489-496. BibRef 9200

Ray, B.K., Ray, K.S.,
An Algorithm for Detection of Dominant Points and Polygonal Approximation of Digitzed Curves,
PRL(13), 1992, pp. 849-856. BibRef 9200

Pikaz, A., Dinstein, I.,
An Algorithm for Polygonal-Approximation Based on Iterative Point Elimination,
PRL(16), No. 6, June 1995, pp. 557-563. BibRef 9506

Rannou, F.R.[Fernando R.], Gregor, J.[Jens],
Equilateral Polygon Approximation of Closed Contours,
PR(29), No. 7, July 1996, pp. 1105-1115.
WWW Version. 9607 BibRef

Wu, J.S., Leou, J.J.,
New Polygonal Approximation Schemes for Object Shape Representation,
PR(26), No. 4, April 1993, pp. 471-484.
WWW Version. BibRef 9304

Sato, Y.,
Piecewise Linear Approximation of Plane Curves by Perimeter Optimization,
PR(25), No. 12, December 1992, pp. 1535-1543.
WWW Version. BibRef 9212

Pikaz, A., Averbuch, A.,
On Automatic Threshold Selection for Polygonal Approximations of Digital Curves,
PR(29), No. 11, November 1996, pp. 1835-1845.
WWW Version. 9612 BibRef

Pei, S.C., Lin, C.N.,
The Detection of Dominant Points on Digital Curves by Scale-Space Filtering,
PR(25), No. 11, November 1992, pp. 1307-1314.
WWW Version. BibRef 9211

Boxer, L., Chang, C.S., Miller, R.,
Polygonal Approximation by Boundary Reduction,
PRL(14), 1993, pp. 111-119. BibRef 9300

Lavakusha, Pujari, A.K., and Reddy, P.G.,
Polygonal Representation by Edge K-D Trees,
PRL(11), 1990, pp. 391-394. BibRef 9000

Leu, J.G., Chen, L.,
Polygonal Approximation of 2-D Shapes Through Boundary Merging,
PRL(7), 1988, pp. 231-238. BibRef 8800

Sirjani, A., Cross, G.R.,
An Algorithm for Polygonal Approximation of a Digital Object,
PRL(7), 1988, pp. 299-303. BibRef 8800

Cordella, L.P., Dettori, G.,
An O(N) Algorithm for Polygonal Approximation,
PRL(3), 1985, pp. 93-97. BibRef 8500

Dettori, G.,
An On-Line Algorithm for Polygonal Approximation of Digitized Plane Curves,
ICPR82(739-741). BibRef 8200

Chan, W.S., Chin, F.,
On Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum Error,
CompGeomApp(6), 1996, pp. 59-77. BibRef 9600

Hu, J.M., Yan, H.,
Polygonal-Approximation of Digital Curves Based on the Principles of Perceptual Organization,
PR(30), No. 5, May 1997, pp. 701-718.
WWW Version. 9705 BibRef

Zhu, Y., Seneviratne, L.D.,
Optimal Polygonal-Approximation of Digitized-Curves,
VISP(144), No. 1, February 1997, pp. 8-14. 9706 BibRef

Ekman, A., Torne, A., Stromberg, D.,
Exploration of Polygonal Environments Using Range Data,
SMC-B(27), No. 2, April 1997, pp. 250-255.
IEEE Top Reference. 9704 BibRef

Schuster, G.M.[Guido M.], Katsaggelos, A.K.,
An Optimal Polygonal Boundary Encoding Scheme in the Rate-Distortion Sense,
IP(7), No. 1, January 1998, pp. 13-26.
IEEE DOI may work or IEEE-CS DOI may work. 9801 BibRef
Earlier:
An Efficient Boundary Encoding Scheme Which Is Optimal in the Rate-Distortion Sense,
ICIP96(17A6). BibRef

Iñesta Quereda, J.M.[José Manuel], Buendía Gómez, M.[Mateo], Sarti, M.A.,
Reliable Polygonal Approximations of Imaged Real Objects Through Dominant Point Detection,
PR(31), No. 6, June 1998, pp. 685-697.
WWW Version. 9806 BibRef

Wang, W.X.,
Binary Image Segmentation of Aggregates Based on Polygonal-Approximation and Classification of Concavities,
PR(31), No. 10, October 1998, pp. 1503-1524.
WWW Version. 9808 BibRef

Wang, W.X., and Stephansson, O.,
Binary Image Segmentation of Aggregates Based on Polygonal Approximation,
SCIA97(xx-yy) 9705
HTML Version. BibRef

Bergevin, R.[Robert], Mokhtari, M.[Marielle],
Multiscale Contour Segmentation and Approximation: An Algorithm Based on the Geometry of Regular Inscribed Polygons,
CVIU(71), No. 1, July 1998, pp. 55-73.
WWW Version. BibRef 9807
Earlier: A2, A1:
Multiscale Compression of Planar Curves Using Constant Curvature Segments,
ICPR98(Vol I: 744-746).
IEEE DOI may work or IEEE-CS DOI may work. 9808 BibRef

Bergevin, R., Bubel, A.,
Object-level structured contour map extraction,
CVIU(91), No. 3, September 2003, pp. 302-334.
WWW Version. 0310Extract contours from junctions. BibRef

Bergevin, R., Bubel, A.,
Detection and characterization of junctions in a 2D image,
CVIU(93), No. 3, March 2004, pp. 288-309.
WWW Version. 0402 BibRef

Garai, G.[Gautam], Chaudhuri, B.B.,
A split and merge procedure for polygonal border detection of dot pattern,
IVC(17), No. 1, January 1999, pp. 75-82.
WWW Version. BibRef 9901

Huang, S.C.[Shu-Chien], Sun, Y.N.[Yung-Nien],
Polygonal approximation using genetic algorithms,
PR(32), No. 8, August 1999, pp. 1409-1420.
WWW Version. BibRef 9908

Davis, T.J.,
Fast Decomposition of Digital Curves into Polygons Using the Haar Transform,
PAMI(21), No. 8, August 1999, pp. 786-790.
IEEE Abstract. IEEE Top Reference.
WWW Version. BibRef 9908

Qjidaa, H., Radouane, L.,
Robust Line Fitting in a Noisy Image by the Method of Moments,
PAMI(21), No. 11, November 1999, pp. 1216-1223.
IEEE Abstract. IEEE Top Reference.
WWW Version. 9912Overcome errors with least squares when the noise is extreme. BibRef

Kiryati, N.[Nahum], Bruckstein, A.M.[Alfred M.], Mizrahi, H.,
Comments on: 'Robust Line Fitting in a Noisy Image by the Method of Moments',
PAMI(22), No. 11, November 2000, pp. 1340-1341.
IEEE Abstract. IEEE Top Reference.
WWW Version. 0012 See also Heteroscedastic Hough Transform (HtHT): An Efficient Method for Robust Line Fitting in the `Errors in the Variables' Problem. BibRef

Kim, J.I.[Jong Il], Bovik, A.C.[Alan C.], Evans, B.L.[Brian L.],
Generalized predictive binary shape coding using polygon approximation,
SP:IC(15), No. 7-8, May 2000, pp. 643-663.
WWW Version. 0005 BibRef

Salotti, M.[Marc],
An efficient algorithm for the optimal polygonal approximation of digitized curves,
PRL(22), No. 2, February 2001, pp. 215-221. 0101 BibRef
Earlier:
Improvement of Perez and Vidal Algorithm for the Decomposition of Digitized Curves Into Line Segments,
ICPR00(Vol II: 878-882).
IEEE DOI may work or IEEE-CS DOI may work.
HTML Version. 0009 See also Optimum Polygonal-Approximation Of Digitized-Curves. BibRef

Salotti, M.[Marc],
Optimal polygonal approximation of digitized curves using the sum of square deviations criterion,
PR(35), No. 2, February 2002, pp. 435-443.
WWW Version. 0201 BibRef

Ho, S.Y.[Shinn-Ying], Chen, Y.C.[Yeong-Chinq],
An efficient evolutionary algorithm for accurate polygonal approximation,
PR(34), No. 12, December 2001, pp. 2305-2317.
WWW Version. 0110 See also Mesh optimization for surface approximation using an efficient coarse-to-fine evolutionary algorithm. BibRef

Shu, H.Z., Luo, L.M., Zhou, J.D., Bao, X.D.,
Moment-based methods for polygonal approximation of digitized curves,
PR(35), No. 2, February 2002, pp. 421-434.
WWW Version. 0201 BibRef

Latecki, L.J.[Longin Jan], Rosenfeld, A.[Azriel],
Recovering a Polygon from Noisy Data,
CVIU(86), No. 1, April 2002, pp. 32-51.
WWW Version. 0211 BibRef

Latecki, L.J.[Longin Jan], Lakämper, R.[Rolf],
Polygon Evolution by Vertex Deletion,
ScaleSpace99(398-409). BibRef 9900

Latecki, L.J.[Longin Jan], Lakaemper, R.[Rolf], Sobel, M.[Marc],
Polygonal Approximation of Point Sets,
IWCIA06(159-173).
WWW Version. 0606 BibRef

Choi, J.G., Lee, S.W., Kang, H.S.,
Dynamic programming approach to optimal vertex selection for polygon-based shape approximation,
VISP(150), No. 4, October 2003, pp. 287-291.
IEEE Abstract. IEEE Top Reference. 0401 BibRef

Dörksen-Reiter, H.[Helene], Debled-Rennesson, I.[Isabelle],
A Linear Algorithm for Polygonal Representations of Digital Sets,
IWCIA06(307-319).
WWW Version. 0606 BibRef

Debled-Rennesson, I.[Isabelle], Tabbone, S.A.[Salvatore A.], Wendling, L.[Laurent],
Multiorder polygonal approximation of digital curves,
ELCVIA(5), No. 2, 2005, pp. 98-110.
WWW Version. 0001 BibRef
Earlier:
Fast polygonal approximation of digital curves,
ICPR04(I: 465-468).
IEEE DOI may work or IEEE-CS DOI may work. 0409 See also Linear Algorithm for Segmentation of Digital Curves, A. BibRef

Nguyen, T.P.[Thanh Phuong], Debled-Rennesson, I.[Isabelle],
Curvature Estimation in Noisy Curves,
CAIP07(474-481).
WWW Version. 0708 BibRef

Kolesnikov, A.[Alexander], Fränti, P.[Pasi],
Reduced-search dynamic programming for approximation of polygonal curves,
PRL(24), No. 14, October 2003, pp. 2243-2254.
WWW Version. 0307 BibRef
Earlier:
A fast near-optimal algorithm for approximation of polygonal curves,
ICPR02(IV: 335-338).
IEEE DOI may work or IEEE-CS DOI may work. 0211 BibRef

Kolesnikov, A., Franti, P., Wu, X.L.[Xiao-Lin],
Multiresolution polygonal approximation of digital curves,
ICPR04(II: 855-858).
IEEE DOI may work or IEEE-CS DOI may work. 0409 BibRef

Kolesnikov, A.[Alexander], Fränti, P.[Pasi],
Polygonal approximation of closed discrete curves,
PR(40), No. 4, April 2007, pp. 1282-1293.
WWW Version. 0701 BibRef
Earlier:
Optimal Algorithm for Convexity Measure Calculation,
ICIP05(I: 353-356).
IEEE DOI may work or IEEE-CS DOI may work. 0512 BibRef
Earlier:
Min-e Polygonal Approximation of Closed Curves,
ICIP05(II: 522-525).
IEEE DOI may work or IEEE-CS DOI may work. 0512 BibRef
Earlier:
Optimal multiresolution polygonal approximation,
ICIP04(V: 3037-3040).
IEEE DOI may work or IEEE-CS DOI may work. 0505 BibRef
Earlier:
Polygonal Approximation of Closed Contours,
SCIA03(778-785).
WWW Version. 0310 BibRef
And:
Fast algorithm for multiple-objects MIN-e problem,
ICIP03(I: 221-224).
IEEE Abstract. IEEE Top Reference. 0312Polygonal approximation; Closed contour; Dynamic programming Approximation of polygonal curves. BibRef

Panagiotakis, C.[Costas], Tziritas, G.[George],
Any dimension polygonal approximation based on equal errors principle,
PRL(28), No. 5, 1 April 2007, pp. 582-591.
WWW Version. 0703Polygonal approximation; Equal errors principle BibRef

Krolupper, F.[Filip], Flusser, J.[Jan],
Polygonal shape description for recognition of partially occluded objects,
PRL(28), No. 9, 1 July 2007, pp. 1002-1011.
WWW Version. 0704Occluded object recognition; Polygonal approximation; Affine invariant BibRef

Bhowmick, P.[Partha], Bhattacharya, B.B.[Bhargab B.],
Fast Polygonal Approximation of Digital Curves Using Relaxed Straightness Properties,
PAMI(29), No. 9, September 2007, pp. 1590-1602.
IEEE DOI may work or IEEE-CS DOI may work. 0709 BibRef

Bhowmick, P.[Partha], Biswas, A.[Arindam], Bhattacharya, B.B.[Bhargab B.],
PACE: Polygonal Approximation of Thick Digital Curves Using Cellular Envelope,
ICCVGIP06(299-310).
WWW Version. 0612 BibRef

Masood, A.[Asif],
Optimized polygonal approximation by dominant point deletion,
PR(41), No. 1, January 2008, pp. 227-239.
WWW Version. 0710Dominant points; Polygonal approximation; DP table; Associated error value; Optimal algorithm BibRef

Masood, A.[Asif], Haq, S.A.[Shaiq A.],
A novel approach to polygonal approximation of digital curves,
JVCIR(18), No. 3, June 2007, pp. 264-274.
WWW Version. 0711Dominant points; Break points; Polygonal approximation; DP table; Near optimal algorithm BibRef

Masood, A.[Asif],
Dominant point detection by reverse polygonization of digital curves,
IVC(26), No. 5, May 2008, pp. 702-715.
WWW Version. 0803Reverse polygonization; Dominant points; Break points; Polygonal approximation BibRef

Chung, K.L.[Kuo-Liang], Liao, P.H.[Po-Hsuan], Chang, J.M.[Jia-Ming],
Novel efficient two-pass algorithm for closed polygonal approximation based on LISE and curvature constraint criteria,
JVCIR(19), No. 4, May 2008, pp. 219-230.
WWW Version. 0711Algorithm; Closed curve; Closed polygonal approximation algorithm; Curvature; Local integral square error; Shortest path algorithm BibRef

Yun, B.J.[Byoung-Ju], Cho, J.S.[Jae-Soo], Ko, Y.H.[Yun-Ho],
A New Vertex Adjustment Method for Polygon-Based Shape Coding,
IEICE(E89-D), No. 10, October 2006, pp. 2693-2695.
WWW Version. 0610 BibRef

Oh, K.M.[Kwang-Man], Choi, J.D.[Jeong-Dan], Lee, C.S.[Chan-Su], Park, C.J.[Chan-Jong], Lee, E.T.[Ee-Taek],
An Efficient and Simple Quad Edge Conversion of Polygonal Mainfold Objects,
IJIG(1), No. 2, April 2001, pp. 251-271. 0104 BibRef

Sarkar, B.[Biswajit], Singh, L.K.[Lokendra Kumar], Sarkar, D.[Debranjan],
A Genetic Algorithm-based Approach For Detection Of Significant Vertices For Polygonal Approximation Of Digital Curves,
IJIG(4), No. 2, April 2004, pp. 223-239. 0404 BibRef

Zillich, M.[Michael], Vincze, M.[Markus],
Anytimeness avoids parameters in detecting closed convex polygons,
Tensor08(1-8).
IEEE DOI may work or IEEE-CS DOI may work. 0806 BibRef

Juengling, R.[Ralf], Prasad, L.[Lakshman],
Parsing Silhouettes without Boundary Curvature,
CIAP07(665-670).
IEEE DOI may work or IEEE-CS DOI may work. 0709Find overlapping set of ribbons. BibRef

Feschet, F.[Fabien],
Fast Guaranteed Polygonal Approximations of Closed Digital Curves,
SCIA05(910-919).
WWW Version. 0506 BibRef

Nguyen, T.[Trung],
A Linear Algorithm for Polygonal Approximations of Thick Curves,
CAIP05(17).
WWW Version. 0509 BibRef

Alhalabi, F.[Firas], Tougne, L.[Laure],
Toward Polygonalisation of Thick Discrete Arcs,
CAIP05(197).
WWW Version. 0509 BibRef

Li, F.J.[Fa-Jie], Klette, R.[Reinhard],
Decomposing a Simple Polygon into Trapezoids,
CAIP07(726-733).
WWW Version. 0708 BibRef
Earlier:
Minimum-Length Polygons of First-Class Simple Cube-Curves,
CAIP05(321).
WWW Version. 0509 BibRef
Earlier:
Minimum-Length Polygon of a Simple Cube-Curve in 3D Space,
IWCIA04(502-511).
WWW Version. 0505 BibRef

Kaess, M.[Michael], Zboinski, R.[Rafal], Dellaert, F.[Frank],
MCMC-Based Multiview Reconstruction of Piecewise Smooth Subdivision Curves with a Variable Number of Control Points,
ECCV04(Vol III: 329-341).
WWW Version. 0405 BibRef

Kaess, M.[Michael], Dellaert, F.[Frank],
Reconstruction of objects with jagged edges through Rao-Blackwellized fitting of piecewise smooth subdivision curves,
HLK03(39-47).
IEEE Abstract. IEEE Top Reference. 0402Model irregular curve sections. BibRef

Mikheev, A., Vincent, L., Faber, V.,
High-quality polygonal contour approximation based on relaxation,
ICDAR01(361-365).
IEEE DOI may work or IEEE-CS DOI may work. 0109 BibRef

Traver, V.J.[V. Javier], Recatalá, G.[Gabriel], Iñesta, J.M.[Jose Manuel],
Exploring the Performance of Genetic Algorithms as Polygonal Approximators,
ICPR00(Vol III: 766-769).
IEEE DOI may work or IEEE-CS DOI may work.
IEEE DOI may work or IEEE-CS DOI may work.
HTML Version. 0009 BibRef

Recatalá, G., Iñesta, J.M.,
Polygonal Approximations through Genetic Algorithms,
SCIA99(Pattern Recognition). BibRef 9900

Schroder, K.[Karsten], Laurent, P.[Patrick],
Efficient Polygon Approximations for Shape Signatures,
ICIP99(II:811-814).
IEEE Abstract. IEEE Top Reference. BibRef 9900

Shmulevich, I.[Ilya], Yli-Harja, O.[Olli],
Coding of Shape Contours Using a Minimal Set of Control Points,
ICIP99(26PP3). Not in proceedings. BibRef 9900

Hosur, P.I., Ma, K.K.[Kai-Kuang],
Optimal Algorithm for Progressive Polygon Approximation of Discrete Plannar Curves,
ICIP99(I:16-20).
IEEE Abstract. IEEE Top Reference. BibRef 9900

Tung, L.H.[Lun Hsing], King, I.[Irwin],
A two-stage framework for polygon retrieval using Minimum Circular Error Bound,
CIAP97(I: 567-574).
WWW Version. 9709 BibRef

van der Heijden, G.W.A.M.,
Construction of a polygonal model using the Fisher-ratio criterion,
ICPR94(A:210-215).
IEEE DOI may work or IEEE-CS DOI may work. 9410 BibRef

Neagoe, V.,
Legendre descriptors for classification of polygonal closed curves,
ICPR92(II:717-720).
IEEE DOI may work or IEEE-CS DOI may work. 9208 BibRef

Neagoe, V.,
Seeking pattern recognition principles for intelligent detection of FSK signals,
ICPR92(II:721-724).
IEEE DOI may work or IEEE-CS DOI may work. 9208 BibRef

Wong, K.C., Kittler, J.V., Illingworth, J.,
Heuristically Guided Polygon Finding,
BMVC91(xx-yy).
PDF Version. 9109 BibRef

Deguchi, K., Aoki, S.,
Regularized polygonal approximation for analysis and interpretation of planar contour figures,
ICPR90(I: 865-869).
IEEE DOI may work or IEEE-CS DOI may work. 9006 BibRef

Suzuki, K., Nishida, Y., and Hata, S.,
A Fast Polygonal Approximation Method for Real-Time Shape Recognition,
CVPR86(388-394). Generation of piecewise approximations, and using them. BibRef 8600

Chapter on Edge Detection and Analysis, Lines, Segments, Curves, Corners, Hough Transform continues in
General Polygonal Representations and Computations .