*Sugihara, K.*,

**Picture Language for Skeletal Polyhedra**,

*CGIP(8)*, No. 3, December 1978, pp. 382-405.

WWW Link.
BibRef
**7812**

*Burton, W.[Warren]*,

**Representation of Many-Sided Polygons and Polygonal Lines for
Rapid Processing**,

*CACM(20)*, No. 3, March 1977, pp. 166-171.

WWW Link.
BibRef
**7703**

*Bookstein, F.L.*,

**The Line Skeleton**,

*CGIP(11)*, No. 2, October 1979, pp. 123-137.

WWW Link.
BibRef
**7910**

*Little, J.J.*,
*Peucker, T.K.*,

**A Recursive Procedure for Finding the Intersection of Two
Digital Curves**,

*CGIP(10)*, No. 2, June 1979, pp. 159-171.

WWW Link.
BibRef
**7906**

*Maxwell, P.C.*,
*Baker, P.W.*,

**The Generation of Polygons Representing Circles, Ellipses
and Hyperbolas**,

*CGIP(10)*, No. 1, May 1979, pp. 84-93.

WWW Link.
BibRef
**7905**

*Bentley, J.L.*,
*Wood, D.*,

**An Optimal Worst-Case Algorithm for Reporting Intersections
of Rectangles**,

*TC(29)*, 1980, pp. 571-577.
*Intersections*.
BibRef
**8000**

*Brown, K.Q.*,

**Comments on
'Algorithms for Reporting and Counting Geometric Intersections'**,

*TC(30)*, 1981, pp. 147-148.
BibRef
**8100**

*Tanimoto, S.L.*,

**A Method for Detecting Structure in Polygons**,

*PR(13)*, No. 6, 1981, pp. 389-394.

WWW Link.
BibRef
**8100**

*Collard, R.F.A.*,
*Buffart, H.F.J.M.*,

**Minimization of Structural Information:
A Set-Theoretical Approach**,

*PR(16)*, No. 2, 1983, pp. 231-242.

WWW Link.
BibRef
**8300**

*Sanz, J.L.C.*,

**A New Method for Computing Polygonal Masks In Image Processing Pipeline
Architectures**,

*PR(18)*, No. 3-4, 1985, pp. 241-247.

WWW Link.
BibRef
**8500**

*O'Rourke, J.*,

**An On-Line Algorithm for Fitting Straight Lines Between Data Ranges**,

*CACM(24)*, 1981, pp. 574-578.
BibRef
**8100**

*O'Rourke, J.*,
*Chien, C.B.*,
*Olson, T.*, and
*Naddor, D.*,

**A New Linear Algorithm for Intersecting Convex Polygons**,

*CGIP(19)*, No. 4, August 1982, pp. 384-391.

WWW Link.
See also Polygon Decomposition and Switching Function Minimization.
BibRef
**8208**

*Kashyap, R.L.*, and
*Oommen, B.J.*,

**Scale Preserving Smoothing of Polygons**,

*PAMI(5)*, No. 6, November 1983, pp. 667-671.
BibRef
**8311**

*Franklin, W.R.*,

**Rays: New Representation for Polygons and Polyhedra**,

*CVGIP(22)*, No. 3, June 1983, pp. 327-338.

WWW Link.
BibRef
**8306**

*Williams, C.M.*,

**The Trapezoidal Approximation of Digitized Images**,

*CVGIP(27)*, No. 1, July 1984, pp. 64-77.

WWW Link.
BibRef
**8407**

*Yang, M.C.K.*,
*Yang, C.C.*,

**Assessment of the Intersection Probabilities of
Random Line Segments And Squares**,

*CVGIP(26)*, No. 3, June 1984, pp. 319-330.

WWW Link.
BibRef
**8406**

*van Wyk, C.J.*,

**Clipping to the Boundary of a Circular-Arc Polygon**,

*CVGIP(25)*, No. 3, March 1984, pp. 383-392.

WWW Link.
BibRef
**8403**

*Guting, R.H.*,

**Dynamic C-Oriented Polygonal Intersection Searching**,

*InfoControl(63)*, 1984, pp. 143-163.
BibRef
**8400**

*Aggarwal, A.*,
*Chang, J.S.*,
*Yap, C.K.*,

**Minimum Area Circumscribing Polygons**,

*VC(1)*, 1985, pp. 112-117.
BibRef
**8500**

*O'Rourke, J.*,

**Counterexamples to a Minimal Circumscription Algorithm**,

*CVGIP(30)*, No. 3, June 1985, pp. 364-366.

WWW Link.
BibRef
**8506**

*Toussaint, G.T.*,

**A Single Linear Algorithm for Intersecting Convex Polygons**,

*VC(1)*, 1985, pp. 118-123.
See also New Linear Algorithm for Triangulating Monotone Polygons, A. See also Simple Proof of Pach's Extremal Theorem for Convex Polygons, A.
BibRef
**8500**

*Sederberg, T.W.[Thomas W.]*,
*Anderson, D.C.[David C.]*,
*Goldman, R.N.[Ronald N.]*,

**Implicitization, Inversion, and Intersection of
Planar Rational Cubic Curves**,

*CVGIP(31)*, No. 1, July 1985, pp. 89-102.

WWW Link.
*Splines*.
BibRef
**8507**

*Lee, D.T.*,

**Visibility of a Simple Polygon**,

*CVGIP(22)*, No. 2, May 1983, pp. 207-221.

WWW Link.
BibRef
**8305**

*Lee, D.T.*, and
*Lin, A.K.*,

**Computing the Visibility Polygon from an Edge**,

*CVGIP(34)*, No. 1, April 1986, pp. 1-19.

WWW Link.
BibRef
**8604**

*Lee, D.T.*,
*Silio, C.B.*,

**An Optimal Illumination Region Algorithm for Convex Polygons**,

*TC(31)*, 1983, pp. 1225-1227.
BibRef
**8300**

*Suri, S.*,

**A Linear Time Algorithm for Minimum Link Paths inside a Simple Polygon**,

*CVGIP(35)*, No. 1, July 1986, pp. 99-110.

WWW Link.
BibRef
**8607**

*Avis, D.*,
*Gum, T.*,
*Toussaint, G.T.*,

**Visibility Between Two Edges of a Simple Polygon**,

*VC(2)*, 1986, pp. 342-357.
BibRef
**8600**

*Sitharama Iyengar, S.*,
*Miller, S.W.*,

**Efficient Algorithm for Polygon Overlay for Dense Map Image Data Sets**,

*IVC(4)*, No. 3, August 1986, pp. 167-174.

WWW Link.
BibRef
**8608**

Earlier: A2, A1:

**Representation of Regions of Map Data for Efficient
Comparison and Retrieval**,

*CVPR83*(102-107).
BibRef

*Kundu, S.[Sukhamay]*,

**A New O(Nlogn) Algorithm for Computing the Intersection
of Convex Polygons**,

*PR(20)*, No. 4, 1987, pp. 419-424.

WWW Link.
BibRef
**8700**

*Kundu, S.*,

**The Equivalence of the Subregion Representation and the
Wall Representation for a Certain Class of Rectangular Dissections**,

*CACM(31)*, No. 6, June 1988, pp. 752-763.
BibRef
**8806**

*Hemminger, T.L.*, and
*Pomalaza-Raez, C.A.*,

**Polygonal Representation: A Maximum Likelihood Approach**,

*CVGIP(52)*, No. 2, November 1990, pp. 239-247.

WWW Link. Start from perfect digital straight lines and merge them.
BibRef
**9011**

*Goodrich, M.T.[Michael T.]*,
*Snoeyink, J.S.[Jack Scott]*,

**Stabbing parallel segments with a convex polygon**,

*CVGIP(49)*, No. 2, February 1990, pp. 152-170.

WWW Link.
BibRef
**9002**

*Ghosh, P.K.*,

**A Solution of Polygon Containment, Spatial Planning, and Other Related
Problems Using Minkowski Operations**,

*CVGIP(49)*, No. 1, January 1990, pp. 1-35.

WWW Link.
BibRef
**9001**

*Ghosh, P.K.[Pijush K.]*,

**An Algebra of Polygons through the Notion of Negative Shapes**,

*CVGIP(54)*, No. 1, July 1991, pp. 119-144.

WWW Link.
BibRef
**9107**

*Bornstein, R.*,
*Bruckstein, A.M.*,

**Finding the kernel of planar shapes**,

*PR(24)*, No. 11, 1991, pp. 1019-1035.

WWW Link.
BibRef
**9100**

*Yu, B.[Bin]*,
*Lin, X.G.[Xing-Gang]*,
*Wu, Y.S.[You-Shou]*,
*Yuan, B.Z.[Bao-Zong]*,

**Isothetic Polygon Representation for Contours**,

*CVGIP(56)*, No. 2, September 1992, pp. 264-268.

WWW Link.
BibRef
**9209**

*Chen, J.M.*,
*Ventura, J.A.*,
*Melloy, B.J.*,

**An Optimization Algorithm for Shape Analysis of Regular Polygons**,

*MVA(7)*, 1994, pp. 82-92.
See also Optimization Models for Shape-Matching of Nonconvex Polygons.
BibRef
**9400**

*Bhavnagri, B.*,

**A Method for Representing Shape-Based on an Equivalence
Relation on Polygons**,

*PR(27)*, No. 2, February 1994, pp. 247-260.

WWW Link.
BibRef
**9402**

*Milanfar, P.*,
*Karl, W.C.*,
*Willsky, A.S.*,

**Reconstructing Binary Polygonal Objects from Projections:
A Statistical View**,

*GMIP(56)*, No. 5, September 1994, pp. 371-391.
BibRef
**9409**

*Jones, M.*,
*Oakley, J.P.*,

**Efficient Representation of Object Shape for Silhouette Intersection**,

*VISP(142)*, No. 6, December 1995, pp. 359-365.
BibRef
**9512**

*Mount, D.M.*,
*Silverman, R.*,
*Wu, A.Y.*,

**On the Area of Overlap of Translated Polygons**,

*CVIU(64)*, No. 1, July 1996, pp. 53-61.
**9608**

DOI Link
BibRef

And:
*UMD*TR3201, 1994.

WWW Link.
BibRef

*Belcastro, L.*,
*Karl, W.C.*,
*Willsky, A.S.*,

**Tomographic Reconstruction of Polygons from Knot Location and
Chord Length Measurements**,

*GMIP(58)*, No. 3, May 1996, pp. 233-245.
**9606**

BibRef

*Barequet, G.*,
*Sharir, M.*,

**Piecewise-Linear Interpolation between Polygonal Slices**,

*CVIU(63)*, No. 2, March 1996, pp. 251-272.

DOI Link
BibRef
**9603**

*Capoyleas, V.*,

**Clamping of Polygonal Objects**,

*PRL(14)*, 1993, pp. 707-714.
BibRef
**9300**

*Shermer, T.*,

**On Recognizing Unions of Two Convex Polygons and Related Problems**,

*PRL(14)*, 1993, pp. 737-745.
BibRef
**9300**

*Pujari, A.K.*,

**Separability of Unimodal Polygons**,

*PRL(7)*, 1988, pp. 163-165.
BibRef
**8800**

*Toussaint, G.T.*,

**A Linear-Time Algorithm for Solving the Strong Hidden-Line Problem
in a Simple Polygon**,

*PRL(4)*, 1986, pp. 449-451.
BibRef
**8600**

*Toussaint, G.T.*,

**Shortest Path Solves Edge-to-Edge Visibility in a Polygon**,

*PRL(4)*, 1986, pp. 165-170.
BibRef
**8600**

*Rappaport, D.*,
*Toussaint, G.T.*,

**A Simple Linear Hidden-Line Algorithm for Star-Shaped Polygons**,

*PRL(3)*, 1985, pp. 35-39.
BibRef
**8500**

*Chin, F.*,
*Wang, C.A.*,

**Optimal Algorithms for the Intersection and the Minimum Distance Problems
Between Planar Polygons**,

*TC(32)*, 1983, pp. 1203-1207.
BibRef
**8300**

*Guting, R.H.*,
*Wood, D.*,

**Finding Rectangle Intersections by Divide-and-Conquer**,

*TC(33)*, 1984, pp. 671-675.
BibRef
**8400**

*Buvaneswari, A.*,
*Naidu, P.S.*,

**Estimation of Shape of Binary Polygonal Object from Scattered Field**,

*IP(7)*, No. 2, February 1998, pp. 253-257.

IEEE DOI
**9802**

BibRef

*Miyaoku, K.[Kento]*,
*Harada, K.[Koichi]*,

**Approximating Polygonal Curves in Two and Three Dimensions**,

*GMIP(60)*, No. 3, May 1998, pp. p222-225.
BibRef
**9805**

*Yin, P.Y.[Peng-Yeng]*,

**A New Method for Polygonal Approximation Using Genetic Algorithms**,

*PRL(19)*, No. 11, 30 September 1998, pp. 1017-1026.
**9811**

BibRef

*Yin, P.Y.[Peng-Yeng]*,

**Genetic Algorithms for Polygonal Approximation of Digital Curves**,

*PRAI(13)*, No. 7, November 1999, pp. 1061.
**0005**

BibRef

Earlier:

**Polygonal Approximation Using Genetic Algorithms**,

*CAIP99*(175-182).

Springer DOI
**9909**

BibRef

*Yin, P.Y.[Peng-Yeng]*,

**Ant colony search algorithms for optimal polygonal approximation of
plane curves**,

*PR(36)*, No. 8, August 2003, pp. 1783-1797.

WWW Link.
**0304**

BibRef

*Yin, P.Y.[Peng-Yeng]*,

**A discrete particle swarm algorithm for optimal polygonal approximation
of digital curves**,

*JVCIR(15)*, No. 2, June 2004, pp. 241-260.

WWW Link.
**0405**

See also Particle swarm optimization for point pattern matching.
BibRef

*Barequet, G.[Gill]*,
*Wolfers, B.[Barbara]*,

**Optimizing a Strip Separating Two Polygons**,

*GMIP(60)*, No. 3, May 1998, pp. 214-221.
BibRef
**9805**

*Tan, T.N.*,

**From Image Quadrilaterals to Symmetrical Trapezia**,

*PR(31)*, No. 8, August 1998, pp. 1117-1125.

WWW Link.
**9807**

BibRef

*Leung, Y.[Yee]*,
*Yan, J.P.[Jian-Ping]*,

**Point-in-Polygon Analysis Under Certainty and Uncertainty**,

*GeoInfo(1)*, No. 1, April 1997, pp. 93-114.

DOI Link
BibRef
**9704**

*Olson, C.F.[Clark F.]*,

**Locating geometric primitives by pruning the parameter space**,

*PR(34)*, No. 6, June 2001, pp. 1247-1256.

WWW Link.

PDF File.
**0103**

BibRef

*Canham, R.O.*,
*Smith, S.L.*,
*Tyrrell, A.M.*,

**Recognition and Grading of Severely Distorted Geometric Shapes from
within a Complex Figure**,

*PAA(3)*, No. 4, 2000, pp. 335-347.

Springer DOI
**0103**

BibRef

*Canham, R.O.*,
*Smith, S.L.*,
*Tyrrell, A.M.*,

**Location of structural sections from within a highly distorted complex
line drawing**,

*VISP(152)*, No. 6, December 2005, pp. 741-749.

DOI Link
**0512**

BibRef

*Sugihara, K.[Kokichi]*,

**Hyperpolygons generated by the invertible Minkowski sum of polygons**,

*PRL(25)*, No. 5, 5 April 2004, pp. 551-560.

WWW Link.
**0403**

BibRef

Earlier:

**Hyperfigures and Their Interpretations**,

*WTRCV02*(231-246).
**0204**

BibRef

*El Badawy, O.*,
*Kamel, M.S.*,

**Hierarchical representation of 2-D shapes using convex polygons: a
contour-based approach**,

*PRL(26)*, No. 7, 15 May 2005, pp. 865-877.

WWW Link.
**0506**

BibRef

Earlier:

**Compressing 2-D Shapes Using Concavity Trees**,

*ICIAR05*(559-566).

Springer DOI
**0509**

BibRef

*Wang, S.X.[Shu-Xia]*,
*Qin, S.F.[Sheng-Feng]*,
*Gao, M.[Mantun]*,

**New grouping and fitting methods for interactive overtraced sketches**,

*VC(30)*, No. 3, March 2014, pp. 285-297.

WWW Link.
**1403**

BibRef

*Sivignon, I.[Isabelle]*,

**A Near-Linear Time Guaranteed Algorithm for Digital Curve
Simplification Under the Fréchet Distance**,

*IPOL(2014)*, No. 2014, pp. 116-127.

DOI Link
**1407**

*Code, Curve Partitions*.
BibRef
*DGCI11*(333-345).

Springer DOI
**1104**

BibRef

IEEE DOI

convex decomposition; polygon segmentation; skeleton BibRef

*Brimkov, V.E.[Valentin E.]*,
*Kafer, S.[Sean]*,
*Szczepankiewicz, M.[Matthew]*,
*Terhaar, J.[Joshua]*,

**On Intersection Graphs of Convex Polygons**,

*IWCIA14*(25-36).

Springer DOI
**1405**

BibRef

*Guha, S.[Sumanta]*,
*Khánh, K.T.[Kiêu Trong]*,

**Preprocessing Convex Polygons Using Range Trees for Recognition with
Few Finger Probes**,

*CAIP05*(338).

Springer DOI
**0509**

BibRef

*Gatos, B.*,
*Mantzaris, S.L.*,

**A Novel Recursive Algorithm for Area Location Using Isothetic Polygons**,

*ICPR00*(Vol III: 492-495).

IEEE DOI
**0009**

BibRef

*Kase, D.*,
*Hamamoto, T.*,
*Hangai, S.*,

**An Interactive Quality Evaluation of Reduced Polygon Model**,

*ICIP00*(Vol II: 879-882).

IEEE DOI
**0008**

BibRef

*Sali, E.*,
*Ullman, S.*,

**Combining Class-Specific Fragments for Object Classification**,

*BMVC99*(Posters/Demos).

PDF File.
**9909**

BibRef

Chapter on Edge Detection and Analysis, Lines, Segments, Curves, Corners, Hough Transform continues in

Polygonal Decomposition Techniques .

Last update:Sep 18, 2017 at 11:34:11