Golomb, S.W.,
Tiling with polyominoes,
JCT-A(1), 1966, pp. 280-296.
BibRef
6600
Golomb, S.W.,
Polyominoes which Tile Rectangles,
JCT-A(51), 1989, pp. 117-124.
BibRef
8900
Feng, H.Y.F., and
Pablidis, T.,
Decomposition of Polygons into Simpler Components,
TC(24), No. 6, June 1975, pp. 636-650.
BibRef
7506
Schachter, B.,
Decomposition of Polygons into Convex Sets,
TC(27), No. 11, November 1978, pp. 1078-1082.
BibRef
7811
Chow, W.W.,
Automatic Generation of Interlocking Shapes,
CGIP(9), No. 4, April 1979, pp. 333-353.
WWW Version.
BibRef
7904
Shapiro, L.G.[Linda G.],
A Structural Model of Shape,
PAMI(2), No. 2, March 1980, pp. 111-126.
BibRef
8003
Shapiro, L.G.[Linda G.], and
Haralick, R.M.[Robert M.],
Decomposition of Two-Dimensional Shapes by
Graph-Theoretic Clustering,
PAMI(1), No. 1, January 1979, pp. 10-20.
BibRef
7901
Guerra, C., and
Pieroni, G.G.,
A Graph-Theoretic Method for Decomposing Two-Dimensional Polygonal
Shapes into Meaningful Parts,
PAMI(4), No. 4, July 1982, pp. 405-408.
BibRef
8207
Bjorklund, C.M., and
Pavlidis, T.,
Global Shape Analysis by k-Syntactic Similarity,
PAMI(3), No. 2, March 1981, pp. 144-155.
BibRef
8103
And: A1 only:
Ph.D.Thesis, Princeton, May 1979.
BibRef
Bjorklund, C.M., and
Pavlidis, T.,
Global Shape Decomposition Using the k-Syntactic Similarity Approach,
PRIP79(445-452).
BibRef
7900
O'Rourke, J.,
Polygon Decomposition and Switching Function Minimization,
CGIP(18), No. 4, April 1982, pp. 382-391.
WWW Version. See also New Linear Algorithm for Intersecting Convex Polygons, A.
BibRef
8204
O'Rourke, J.,
Supowit, K.J.,
Some NP-Hard Polygon Decomposition Problems,
IT(29), 1983, pp. 181-190.
BibRef
8300
Nevins, A.J.,
Region Extraction from Complex Shapes,
PAMI(4), No. 5, September 1982, pp. 500-511.
Decomposition into convex polygons.
BibRef
8209
Ferrari, L.A.,
Sankar, P.V., and
Sklansky, J.,
Minimal Rectangular Partitions of Digitized Blobs,
CVGIP(28), No. 1, October 1984, pp. 58-71.
WWW Version.
BibRef
8410
Earlier:
ICPR80(1040-1043).
(UC Irvine) Partition into the minimum number of nonoverlapping rectangles.
See also Recognition of Convex Blobs.
See also Parallel Detection of Concavities in Cellular Blobs.
BibRef
Cappellini, V.,
del Bimbo, A.,
Mecocci, A.,
Object Decomposition and Subpart Identification:
Classification Algorithms,
IVC(2), No. 2, May 1984, pp. 109-113.
WWW Version.
BibRef
8405
Franzblau, D.S.,
Kleitman, D.J.,
An Algorithm for Covering Polygons with Rectangles,
IC(63), 1984, pp. 164-184.
BibRef
8400
Coffman, Jr., E.G.,
Gilbert, E.N.,
Dynamic, First-Fit Packings in Two or More Dimensions,
InfoControl(61), 1984, pp. 1-14.
BibRef
8400
Ahuja, N.[Narendra],
On Approaches to Polygonal Decomposition for
Hierarchical Image Representation,
CVGIP(24), No. 2, November 1983, pp. 200-214.
WWW Version. Doesn't seem to say anything shocking, just a summary.
BibRef
8311
Avis, D.,
Toussaint, G.T.,
An Efficient Algorithm for Decomposing a Polygon into
Star-Shaped Polygons,
PR(13), No. 6, 1981, pp. 395-398.
WWW Version.
BibRef
8100
Asano, T.[Takao],
Asano, T.[Tetsuo], and
Imai, H.[Hiroshi],
Partitioning a Polygonal Region into Trapezoids,
JACM(33), No. 2, April 1986, pp. 290-312.
BibRef
8604
Kundu, S.[Sukhamay],
Sridhar, R.[Radhakrishnan],
An O(kN.log N) algorithm for decomposing a set of polygons into
d-separable components,
PR(23), No. 7, 1990, pp. 735-743.
WWW Version.
0401
BibRef
Conway, J.,
Lagarias, J.C.,
Tiling with polyominoes and combinatorial group theory,
JCT-A(53), 1990, pp. 183-208.
BibRef
9000
Wenqi, H.,
Wang, G.Q.,
A Quasi-Mechanical Method for Solving the Rectangle Covering Problem:
An Approach to Tackling NP Hard Problems,
GMIP(56), No. 3, 1994, pp. 267-??.
BibRef
9400
Held, A.,
Abe, K.,
On the Decomposition of Binary Shapes into Meaningful Parts,
PR(27), No. 5, May 1994, pp. 637-647.
WWW Version.
BibRef
9405
Xu, J.N.,
Hierarchical Representation of 2-D Shapes Using Convex Polygons:
A Morphological Approach,
PRL(18), No. 10, October 1997, pp. 1009-1017.
9802
See also generalized discrete morphological skeleton transform with multiple structuring elements for the extraction of structural shape components, A.
BibRef
Xu, J.N.[Jian-Ning],
Morphological Decomposition of 2-D Binary Shapes into
Simpler Shape Parts,
PRL(17), No. 7, June 10 1996, pp. 759-769.
9607
BibRef
Xu, J.N.[Jian-Ning],
Efficient morphological shape representation without searching,
ICIP98(II: 262-266).
WWW Version.
9810
BibRef
Xu, J.N.,
Morphological Decomposition of 2-D Binary Shapes into
Conditionally Maximal Convex Polygons,
PR(29), No. 7, July 1996, pp. 1075-1104.
WWW Version.
9607
BibRef
Earlier:
ICIP94(II: 96-100).
WWW Version.
9411
Convexity.
See also Efficient morphological shape representation by varying overlapping levels among representative disks.
See also Morphological Representation of 2-D Binary Shapes Using Rectangular Components.
BibRef
Tuzikov, A.V.,
Heijmans, H.J.A.M.,
Minkowski Decomposition of Convex Polygons into
Their Symmetrical and Asymmetric Parts,
PRL(19), No. 3-4, March 1998, pp. 247-254.
9807
BibRef
Miller, E.G.[Erik G.],
Alternative Tilings for Improved Surface Area Estimates by Local
Counting Algorithms,
CVIU(74), No. 3, June 1999, pp. 193-211.
WWW Version.
BibRef
9906
Zhang, H.B.[Hong-Bin],
Guo, J.J.[Jian-Jun],
Optimal polygonal approximation of digital planar curves using meta
heuristics,
PR(34), No. 7, July 2001, pp. 1429-1436.
WWW Version.
0105
BibRef
Chung, K.L.[Kuo-Liang],
Yan, W.M.[Wen-Ming],
Chen, W.Y.[Wan-Yue],
Efficient algorithms for 3-D polygonal approximation based on LISE
criterion,
PR(35), No. 11, November 2002, pp. 2539-2548.
WWW Version.
0208
BibRef
Rocha, J.[Jairo],
Perceptually stable regions for arbitrary polygons,
SMC-B(33), No. 1, February 2003, pp. 165-171.
IEEE Top Reference.
0301
BibRef
Rocha, J.[Jairo],
Efficient Polygon Decomposition into Singular and Regular Regions Via
Voronoi Diagrams,
IJDAR(6), No. 2, 2003, pp. 89-101.
WWW Version.
0310
BibRef
Earlier:
Efficient Polygonal Decomposition Into Singular and Regular Regions Via
Voronoi Diagrams,
ICPR00(Vol III: 762-765).
WWW Version.
HTML Version.
0009
BibRef
Wu, W.Y.[Wen-Yen],
An adaptive method for detecting dominant points,
PR(36No. 10, October 2003, pp. 2231-2237.
WWW Version.
0308
BibRef
Wu, W.Y.[Wen-Yen],
A dynamic method for dominant point detection,
GM(64), No. 5, September 2002, pp. Graphical Models, Volume 64, Issue 5, September 2002, 304-315.
WWW Version.
0309
BibRef
Marji, M.[Majed],
Siy, P.[Pepe],
A new algorithm for dominant points detection and polygonization of
digital curves,
PR(36No. 10, October 2003, pp. 2239-2251.
WWW Version.
0308
BibRef
Marji, M.[Majed],
Siy, P.[Pepe],
Polygonal representation of digital planar curves through dominant
point detection: A nonparametric algorithm,
PR(37), No. 11, November 2004, pp. 2113-2130.
WWW Version.
0409
BibRef
Hermes, L.,
Buhmann, J.M.,
A minimum entropy approach to adaptive image polygonization,
IP(12), No. 10, October 2003, pp. 1243-1258.
WWW Version.
0310
BibRef
Juengling, R.[Ralf],
Mitchell, M.[Melanie],
Combinatorial Shape Decomposition,
ISVC07(II: 183-192).
WWW Version.
0711
BibRef
Roussillon, T.[Tristan],
Tougne, L.[Laure],
Sivignon, I.[Isabelle],
Computation of Binary Objects Sides Number using Discrete Geometry,
Application to Automatic Pebbles Shape Analysis,
CIAP07(763-768).
WWW Version.
0709Coarse polygonalization give the number of sides.
See also Linear Algorithm for Segmentation of Digital Curves, A.
BibRef
Ion, A.[Adrian],
Kropatsch, W.G.[Walter G.],
Andres, E.[Eric],
Euclidean Eccentricity Transform by Discrete Arc Paving,
DGCI08(xx-yy).
WWW Version.
0804
BibRef
Kropatsch, W.G.[Walter G.],
Ion, A.[Adrian],
Peltier, S.[Samuel],
Computing the Eccentricity Transform of a Polygonal Shape,
CIARP07(291-300).
WWW Version.
0711
BibRef
Ion, A.[Adrian],
Peltier, S.[Samuel],
Haxhimusa, Y.[Yll],
Kropatsch, W.G.[Walter G.],
Decomposition for Efficient Eccentricity Transform of Convex Shapes,
CAIP07(653-660).
WWW Version.
0708
BibRef
Dexet, M.[Martine],
Coeurjolly, D.[David],
Andres, E.[Eric],
Invertible Polygonalization of 3D Planar Digital Curves and Application
to Volume Data Reconstruction,
ISVC06(II: 514-523).
WWW Version.
0611Linear time extraction. Use for representation of 3D data.
BibRef
Vedhanayagam, M.[Masilamani],
Krithivasan, K.[Kamala],
An Efficient Reconstruction of 2D-Tiling with t1,2, t2,1, t1,1 Tiles,
IWCIA06(474-480).
WWW Version.
0606
BibRef
Bodini, O.[Olivier],
Nouvel, B.[Bertrand],
Z-Tilings of Polyominoes and Standard Basis,
IWCIA04(137-150).
WWW Version.
0505Following on
See also Tiling with polyominoes and combinatorial group theory.
BibRef
Rocha, J.,
Polygon Partition into Stable Regions,
DAGM02(83 ff.).
HTML Version.
0303
BibRef
Tanase, M.[Mirela],
Veltkamp, R.C.[Remco C.],
Polygon Decomposition Based on the Straight Line Skeleton,
WTRCV02(221-244).
0204
BibRef
Ablameyko, S.V.,
Frucci, M.,
Marcelli, A.,
Shape Decomposition by (D1,D2)-Weighted Selection and
Directional Information,
ICPR96(II: 275-279).
WWW Version.
9608(Univ. di Napoli FedericoII, I)
BibRef
Nagao, M.,
Katayama, M.,
Automatic Figure Decomposition into Elementary Features by
Similarity Principle,
ICPR84(63-65).
BibRef
8400
Chapter on Detection and Analysis of Edges, Lines, Curves, Corners, Hough Transform continues in
General Triangulation Models, Delaunay .