Terrain polygon decomposition, with application to layered manufacturing

Ivaylo Ilinkin; Ravi Janardan; Michiel Smid

doi:10.1007/3-540-45655-4_41

Terrain polygon decomposition, with application to layered manufacturing

Ivaylo Ilinkin, Ravi Janardan, Michiel Smid

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

Efficient algorithms are given for decomposing a simple polygon into two special polygons, each with the property that every boundary and interior point can be connected to a single edge by a perpendicular line segment interior to the polygon. This allows efficient construction of certain classes of 3D parts via Layered Manufacturing.

Original language	English (US)
Title of host publication	Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings
Editors	Oscar H. Ibarra, Louxin Zhang
Publisher	Springer Verlag
Pages	381-390
Number of pages	10
ISBN (Print)	354043996X, 9783540439967
DOIs	https://doi.org/10.1007/3-540-45655-4_41
State	Published - 2002
Externally published	Yes
Event	8th Annual International Conference on Computing and Combinatorics, COCOON 2002 - Singapore, Singapore Duration: Aug 15 2002 → Aug 17 2002

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2387
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	8th Annual International Conference on Computing and Combinatorics, COCOON 2002
Country/Territory	Singapore
City	Singapore
Period	8/15/02 → 8/17/02

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access

10.1007/3-540-45655-4_41

OpenUrl availability

Full text

Cite this

Ilinkin, I., Janardan, R., & Smid, M. (2002). Terrain polygon decomposition, with application to layered manufacturing. In O. H. Ibarra, & L. Zhang (Eds.), Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings (pp. 381-390). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2387). Springer Verlag. https://doi.org/10.1007/3-540-45655-4_41

Terrain polygon decomposition, with application to layered manufacturing. / Ilinkin, Ivaylo; Janardan, Ravi; Smid, Michiel.
Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings. ed. / Oscar H. Ibarra; Louxin Zhang. Springer Verlag, 2002. p. 381-390 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2387).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Ilinkin, I, Janardan, R & Smid, M 2002, Terrain polygon decomposition, with application to layered manufacturing. in OH Ibarra & L Zhang (eds), Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2387, Springer Verlag, pp. 381-390, 8th Annual International Conference on Computing and Combinatorics, COCOON 2002, Singapore, Singapore, 8/15/02. https://doi.org/10.1007/3-540-45655-4_41

Ilinkin I, Janardan R, Smid M. Terrain polygon decomposition, with application to layered manufacturing. In Ibarra OH, Zhang L, editors, Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings. Springer Verlag. 2002. p. 381-390. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45655-4_41

Ilinkin, Ivaylo ; Janardan, Ravi ; Smid, Michiel. / Terrain polygon decomposition, with application to layered manufacturing. Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings. editor / Oscar H. Ibarra ; Louxin Zhang. Springer Verlag, 2002. pp. 381-390 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{ffba8705b4ed497cad8280688e605ff0,

title = "Terrain polygon decomposition, with application to layered manufacturing",

abstract = "Efficient algorithms are given for decomposing a simple polygon into two special polygons, each with the property that every boundary and interior point can be connected to a single edge by a perpendicular line segment interior to the polygon. This allows efficient construction of certain classes of 3D parts via Layered Manufacturing.",

author = "Ivaylo Ilinkin and Ravi Janardan and Michiel Smid",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 8th Annual International Conference on Computing and Combinatorics, COCOON 2002 ; Conference date: 15-08-2002 Through 17-08-2002",

year = "2002",

doi = "10.1007/3-540-45655-4_41",

language = "English (US)",

isbn = "354043996X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "381--390",

editor = "Ibarra, {Oscar H.} and Louxin Zhang",

booktitle = "Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings",

}

TY - GEN

T1 - Terrain polygon decomposition, with application to layered manufacturing

AU - Ilinkin, Ivaylo

AU - Janardan, Ravi

AU - Smid, Michiel

PY - 2002

Y1 - 2002

N2 - Efficient algorithms are given for decomposing a simple polygon into two special polygons, each with the property that every boundary and interior point can be connected to a single edge by a perpendicular line segment interior to the polygon. This allows efficient construction of certain classes of 3D parts via Layered Manufacturing.

AB - Efficient algorithms are given for decomposing a simple polygon into two special polygons, each with the property that every boundary and interior point can be connected to a single edge by a perpendicular line segment interior to the polygon. This allows efficient construction of certain classes of 3D parts via Layered Manufacturing.

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

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

U2 - 10.1007/3-540-45655-4_41

DO - 10.1007/3-540-45655-4_41

M3 - Conference contribution

AN - SCOPUS:84949790770

SN - 354043996X

SN - 9783540439967

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

SP - 381

EP - 390

BT - Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings

A2 - Ibarra, Oscar H.

A2 - Zhang, Louxin

PB - Springer Verlag

T2 - 8th Annual International Conference on Computing and Combinatorics, COCOON 2002

Y2 - 15 August 2002 through 17 August 2002

ER -

Terrain polygon decomposition, with application to layered manufacturing

Abstract

Publication series

Other

Bibliographical note

UN SDGs

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this