DECOMPOSING A SIMPLE POLYGON WITH THE RELATIVE NEIGHBORHOOD GRAPH.

Research output: Contribution to conferencePaper

Abstract

The decomposition of a polygon into simpler components plays an important role in syntactic pattern recognition and image processing. A new decompostion is proposed and termed the relative neighbor decomposition (RND). The lune of two vertices p//i, p//j of a polygon P, denoted by LUNE (p//i, p//j) is defined as the intersection of two circles with radius equal to d(p//i, p//j) centered at p//i and p//j, where d denotes Euclidean distance. The RND consists of the polygon P together with a subset of its diagonals. Two vertices p//i,p//j are joined by a diagonal if (a) p//i and p//j are visible to each other and (b) no other visible vertex of p//i or p//j lies inside LUNE (p//i,p//j). It is shown that the RND is planar, i. e. , no two diagonals intersect.

Original languageEnglish (US)
Pages20-28
Number of pages9
StatePublished - Jan 1 2017
EventProc Annu Allerton Conf Commun Control Comput 18th - Monticello, IL, USA
Duration: Oct 8 1980Oct 11 1980

Other

OtherProc Annu Allerton Conf Commun Control Comput 18th
CityMonticello, IL, USA
Period10/8/8010/11/80

Fingerprint

Decomposition
Syntactics
Pattern recognition
Image processing

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Toussaint, G. (2017). DECOMPOSING A SIMPLE POLYGON WITH THE RELATIVE NEIGHBORHOOD GRAPH.. 20-28. Paper presented at Proc Annu Allerton Conf Commun Control Comput 18th, Monticello, IL, USA, .

DECOMPOSING A SIMPLE POLYGON WITH THE RELATIVE NEIGHBORHOOD GRAPH. / Toussaint, Godfried.

2017. 20-28 Paper presented at Proc Annu Allerton Conf Commun Control Comput 18th, Monticello, IL, USA, .

Research output: Contribution to conferencePaper

Toussaint, G 2017, 'DECOMPOSING A SIMPLE POLYGON WITH THE RELATIVE NEIGHBORHOOD GRAPH.' Paper presented at Proc Annu Allerton Conf Commun Control Comput 18th, Monticello, IL, USA, 10/8/80 - 10/11/80, pp. 20-28.
Toussaint G. DECOMPOSING A SIMPLE POLYGON WITH THE RELATIVE NEIGHBORHOOD GRAPH.. 2017. Paper presented at Proc Annu Allerton Conf Commun Control Comput 18th, Monticello, IL, USA, .
Toussaint, Godfried. / DECOMPOSING A SIMPLE POLYGON WITH THE RELATIVE NEIGHBORHOOD GRAPH. Paper presented at Proc Annu Allerton Conf Commun Control Comput 18th, Monticello, IL, USA, .9 p.
@conference{8d1403738653457683defbefba119c5d,
title = "DECOMPOSING A SIMPLE POLYGON WITH THE RELATIVE NEIGHBORHOOD GRAPH.",
abstract = "The decomposition of a polygon into simpler components plays an important role in syntactic pattern recognition and image processing. A new decompostion is proposed and termed the relative neighbor decomposition (RND). The lune of two vertices p//i, p//j of a polygon P, denoted by LUNE (p//i, p//j) is defined as the intersection of two circles with radius equal to d(p//i, p//j) centered at p//i and p//j, where d denotes Euclidean distance. The RND consists of the polygon P together with a subset of its diagonals. Two vertices p//i,p//j are joined by a diagonal if (a) p//i and p//j are visible to each other and (b) no other visible vertex of p//i or p//j lies inside LUNE (p//i,p//j). It is shown that the RND is planar, i. e. , no two diagonals intersect.",
author = "Godfried Toussaint",
year = "2017",
month = "1",
day = "1",
language = "English (US)",
pages = "20--28",
note = "Proc Annu Allerton Conf Commun Control Comput 18th ; Conference date: 08-10-1980 Through 11-10-1980",

}

TY - CONF

T1 - DECOMPOSING A SIMPLE POLYGON WITH THE RELATIVE NEIGHBORHOOD GRAPH.

AU - Toussaint, Godfried

PY - 2017/1/1

Y1 - 2017/1/1

N2 - The decomposition of a polygon into simpler components plays an important role in syntactic pattern recognition and image processing. A new decompostion is proposed and termed the relative neighbor decomposition (RND). The lune of two vertices p//i, p//j of a polygon P, denoted by LUNE (p//i, p//j) is defined as the intersection of two circles with radius equal to d(p//i, p//j) centered at p//i and p//j, where d denotes Euclidean distance. The RND consists of the polygon P together with a subset of its diagonals. Two vertices p//i,p//j are joined by a diagonal if (a) p//i and p//j are visible to each other and (b) no other visible vertex of p//i or p//j lies inside LUNE (p//i,p//j). It is shown that the RND is planar, i. e. , no two diagonals intersect.

AB - The decomposition of a polygon into simpler components plays an important role in syntactic pattern recognition and image processing. A new decompostion is proposed and termed the relative neighbor decomposition (RND). The lune of two vertices p//i, p//j of a polygon P, denoted by LUNE (p//i, p//j) is defined as the intersection of two circles with radius equal to d(p//i, p//j) centered at p//i and p//j, where d denotes Euclidean distance. The RND consists of the polygon P together with a subset of its diagonals. Two vertices p//i,p//j are joined by a diagonal if (a) p//i and p//j are visible to each other and (b) no other visible vertex of p//i or p//j lies inside LUNE (p//i,p//j). It is shown that the RND is planar, i. e. , no two diagonals intersect.

UR - http://www.scopus.com/inward/record.url?scp=0019339387&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019339387&partnerID=8YFLogxK

M3 - Paper

SP - 20

EP - 28

ER -