Efficient algorithms for orthogonal polygon approximation

In applications such as VLSI floorplanning, pattern recognition and image processing, an important problem is to compress the data needed to represent certain geometric structures subject to some approximation criteria so that manipulating these structures would not require excessive amount of compu...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:1996 IEEE International Symposium on Circuits and Systems Ročník 4; s. 779 - 782 vol.4
Hlavní autori: Chen, D.Z., Hu, X., Blatner, P.J.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 1996
Predmet:
Application software
Approximation algorithms
Computer science
Design automation
Image coding
Image processing
Image recognition
Minimization methods
Physics computing
Very large scale integration
ISBN:9780780330733, 0780330730
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In applications such as VLSI floorplanning, pattern recognition and image processing, an important problem is to compress the data needed to represent certain geometric structures subject to some approximation criteria so that manipulating these structures would not require excessive amount of computing resources. Techniques based on polygonal approximation have been used increasingly in such applications. In this paper, we present two efficient yet very simple algorithms to solve the convex orthogonal polygon approximation problem. One of our algorithms takes O(n/sup 3/ log k//spl radic/(log n)) time and O(n/sup 2/) space. The other algorithm only takes O(n) space with the time complexity of O(n/sup 3/k). The previously best known algorithm solves the same problem using O(n/sup 5/) time and O(n/sup 4/) space. In addition to the improvement in both time and space complexities, our algorithms are also simple to understand and simple to implement. Our techniques and observations are quite general in their own right and may be applicable to other problems.
AbstractList In applications such as VLSI floorplanning, pattern recognition and image processing, an important problem is to compress the data needed to represent certain geometric structures subject to some approximation criteria so that manipulating these structures would not require excessive amount of computing resources. Techniques based on polygonal approximation have been used increasingly in such applications. In this paper, we present two efficient yet very simple algorithms to solve the convex orthogonal polygon approximation problem. One of our algorithms takes O(n/sup 3/ log k//spl radic/(log n)) time and O(n/sup 2/) space. The other algorithm only takes O(n) space with the time complexity of O(n/sup 3/k). The previously best known algorithm solves the same problem using O(n/sup 5/) time and O(n/sup 4/) space. In addition to the improvement in both time and space complexities, our algorithms are also simple to understand and simple to implement. Our techniques and observations are quite general in their own right and may be applicable to other problems.
Author Chen, D.Z.
Hu, X.
Blatner, P.J.
Author_xml – sequence: 1
  givenname: D.Z.
  surname: Chen
  fullname: Chen, D.Z.
  organization: Dept. of Comput. Sci. & Eng., Notre Dame Univ., IN, USA
– sequence: 2
  givenname: X.
  surname: Hu
  fullname: Hu, X.
– sequence: 3
  givenname: P.J.
  surname: Blatner
  fullname: Blatner, P.J.
BookMark eNotT81KAzEYDKig1n0APeUFds23SXaTY1mqFgoequeS3zayTZbsHuzbG6jDwMxhmGEe0W1M0SH0DKQBIPJ1ux_W-wak7BrOWhD8BlWyF6SQUtJTeo-qef4hBYzztpMPSG68Dya4uGA1HlMOy-k8Y58yTnk5pWOKasRTGi_FYTVNOf2Gs1pCik_ozqtxdtW_rtD32-Zr-Kh3n-_bYb2rAxC21GAZs0SrFrgA4g0T2morjLEcnPXaaae0Iq4tCUpBa9vqri9pw4XpDaMr9HLtDc65w5TLfL4crv_oH8EuSZ8
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ISCAS.1996.542185
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 782 vol.4
ExternalDocumentID 542185
GroupedDBID 6IE
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIE
RIL
ID FETCH-LOGICAL-i104t-1d44d0ba215810fc48bdbd8ccd51edfbebeaba0e2a21331bbd2b67215c58c7c43
IEDL.DBID RIE
ISBN 9780780330733
0780330730
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=542185&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:45:22 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i104t-1d44d0ba215810fc48bdbd8ccd51edfbebeaba0e2a21331bbd2b67215c58c7c43
ParticipantIDs ieee_primary_542185
PublicationCentury 1900
PublicationDate 19960000
PublicationDateYYYYMMDD 1996-01-01
PublicationDate_xml – year: 1996
  text: 19960000
PublicationDecade 1990
PublicationTitle 1996 IEEE International Symposium on Circuits and Systems
PublicationTitleAbbrev ISCAS
PublicationYear 1996
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000455269
Score 1.2428446
Snippet In applications such as VLSI floorplanning, pattern recognition and image processing, an important problem is to compress the data needed to represent certain...
SourceID ieee
SourceType Publisher
StartPage 779
SubjectTerms Application software
Approximation algorithms
Computer science
Design automation
Image coding
Image processing
Image recognition
Minimization methods
Physics computing
Very large scale integration
Title Efficient algorithms for orthogonal polygon approximation
URI https://ieeexplore.ieee.org/document/542185
Volume 4
WOSCitedRecordID wos542185&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8MwGH5xw4On6Zz4TQ5euyVN2iZHGRt6GYMp7Daaj87CbMfWif57k7SbCF68JaWE8qbh_crzPAAPaUgY4TwNpOQiYMoVmpRQgbG-ybDQaEUzLzaRTCZ8PhfThmfbY2GMMf7ymem7oe_l61LtXKlsEDHrkKIWtJIkrqFah3KKjUycVrZPzDmm_s9t-HX2c9o0NQkWg-fZ8HHmkHpxv170l7iK9y3jzr--6hR6Pxg9ND14nzM4MkUXOnuRBtSc2XMQI08SYZdA6WpZbvLq7X2LbKiKXMemXLpIHK3L1ZcdIc8w_pnXcMYevI5HL8OnoNFLCHKbVFUB0YxpLK35I05wphiXWmqulI6I0Zm0-5XKFJvQvkEpkVKHMrYZYKQirhLF6AW0i7Iwl4CwsI7fRMIlWCxJCRexzLTGRCkhacavoOsMsVjXlBiL2gbXfz69gZP6qrOrW9xCu9rszB0cq48q327u_TZ-A-5xm_4
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bT8IwFD5RNNEnFDHe7YOvg3ZroX00BAIRCQmY8EbWy5AEGYFh9N_bdkNj4otv7bI0S8-a71z6nQ_gIQ4JJZzHgZRcBFS5RJMSKjAWmwwNjVZR4sUmmoMBn0zEsOiz7bkwxhh_-czU3NDX8nWqti5VVmfUAhLbhwNGaYhzstZ3QsX6Jk4t24fmHEf-3y067OzmUVHWJFjUe6PW48hx9Rq1fNlf8ioeXTrlf33XCVR_WHpo-I0_p7BnlhUo72QaUHFqz0C0fZsIuwSKF7N0Pc9e3zbIOqvI1WzSmfPF0SpdfNoR8j3GP-Y5obEKL532uNUNCsWEYG7DqiwgmlKNpTUA4wQninKppeZKaUaMTqS1WCxjbEL7RhQRKXUoGzYGZIpx1VQ0OofSMl2aC0BYWOg3TLgQizZjwkVDJlpjopSQUcIvoeI2YrrKm2JM8z24-vPpPRx1x8_9ab83eLqG4_zis8ti3EApW2_NLRyq92y-Wd95k34BPcWfRQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=1996+IEEE+International+Symposium+on+Circuits+and+Systems&rft.atitle=Efficient+algorithms+for+orthogonal+polygon+approximation&rft.au=Chen%2C+D.Z.&rft.au=Hu%2C+X.&rft.au=Blatner%2C+P.J.&rft.date=1996-01-01&rft.pub=IEEE&rft.isbn=9780780330733&rft.volume=4&rft.spage=779&rft.epage=782+vol.4&rft_id=info:doi/10.1109%2FISCAS.1996.542185&rft.externalDocID=542185
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780330733/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780330733/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780330733/sc.gif&client=summon&freeimage=true