Near-Linear Time Approximation Algorithms for Curve Simplification
Uložené v:
| Vydané v: | Algorithmica Ročník 42; číslo 3-4; s. 203 - 219 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
New York, NY
Springer
01.07.2005
|
| Predmet: | |
| ISSN: | 0178-4617, 1432-0541 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Author | Mustafa, Nabil H. Wang, Yusu Har-Peled, Sariel Agarwal, Pankaj K. |
|---|---|
| Author_xml | – sequence: 1 givenname: Pankaj K. surname: Agarwal fullname: Agarwal, Pankaj K. – sequence: 2 givenname: Sariel surname: Har-Peled fullname: Har-Peled, Sariel – sequence: 3 givenname: Nabil H. surname: Mustafa fullname: Mustafa, Nabil H. – sequence: 4 givenname: Yusu surname: Wang fullname: Wang, Yusu |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17536539$$DView record in Pascal Francis |
| BookMark | eNp9kLtOAzEQRS0UJJLAB9BtQ2mYsddruwwRLymCglCvvI4NRvuSvSDy92wSJCQKqtucezVzZmTSdq0j5BzhEgHkVQLIBacAgiIWgm6PyBRzziiIHCdkCigVzQuUJ2SW0jsAMqmLKbl-dCbSVWjHyNahcdmi72P3FRozhK7NFvVrF8Pw1qTMdzFbfsRPlz2Hpq-DD3bPnJJjb-rkzn5yTl5ub9bLe7p6untYLlbUMikGiqB8gcxUThnuC-e1ExaUlcpJ7TFnKCqNFfCNynkFzHOGbqMrtdGSVYLzObk47PYmWVP7aFobUtnH8da4LVEKXgiuRw4PnI1dStH5XwTKnazyIKscZZU7WeV27Mg_HRuG_XdDNKH-p_kN7bZwjg |
| CitedBy_id | crossref_primary_10_1007_s00454_017_9878_7 crossref_primary_10_1016_j_cad_2009_01_002 crossref_primary_10_1016_j_cag_2015_06_003 crossref_primary_10_1016_j_comgeo_2014_02_002 crossref_primary_10_1145_3015457 crossref_primary_10_1080_13658810903569598 crossref_primary_10_1007_s00454_008_9132_4 crossref_primary_10_1016_j_cageo_2024_105845 crossref_primary_10_4028_www_scientific_net_AMM_128_129_1079 crossref_primary_10_1145_3460121 crossref_primary_10_1137_120865112 crossref_primary_10_1145_1614379_1614382 crossref_primary_10_1016_j_comgeo_2020_101620 crossref_primary_10_1080_23799927_2021_1905717 crossref_primary_10_4304_jnw_7_5_832_837 crossref_primary_10_1007_s00778_011_0237_7 crossref_primary_10_1016_j_gmod_2012_04_006 crossref_primary_10_1007_s10439_013_0924_1 crossref_primary_10_1145_3539660 crossref_primary_10_1002_mats_201000086 crossref_primary_10_1111_tgis_12188 crossref_primary_10_7717_peerj_cs_1112 crossref_primary_10_1007_s00454_012_9402_z |
| ContentType | Journal Article Conference Proceeding |
| Copyright | 2006 INIST-CNRS |
| Copyright_xml | – notice: 2006 INIST-CNRS |
| DBID | AAYXX CITATION IQODW |
| DOI | 10.1007/s00453-005-1165-y |
| DatabaseName | CrossRef Pascal-Francis |
| DatabaseTitle | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science Applied Sciences |
| EISSN | 1432-0541 |
| EndPage | 219 |
| ExternalDocumentID | 17536539 10_1007_s00453_005_1165_y |
| GroupedDBID | -Y2 -~C -~X .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYXX ABAKF ABBBX ABBRH ABBXA ABDBE ABDPE ABDZT ABECU ABFSG ABFSI ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABRTQ ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSTC ACZOJ ADHHG ADHIR ADHKG ADIMF ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFEXP AFGCZ AFHIU AFLOW AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHSBF AHWEU AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG CITATION COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP E.L EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9O PF- PT4 PT5 QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UQL UTJUX UZXMN VC2 VFIZW VH1 W23 W48 WK8 YLTOR Z45 ZMTXR ZY4 ~EX AAYZH ABTAH AESKC IQODW RIG |
| ID | FETCH-LOGICAL-c275t-108f612abe8a3f6ef9e5c08c78e79f14215b91b03d843b02f321ed9b8d972b533 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 56 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000229801600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0178-4617 |
| IngestDate | Wed Apr 02 07:25:36 EDT 2025 Sat Nov 29 03:45:22 EST 2025 Tue Nov 18 22:14:17 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3-4 |
| Keywords | Computational geometry Linear approximation Linear time Approximation algorithms Curve simplification Approximation algorithm Fast algorithm |
| Language | English |
| License | http://www.springer.com/tdm CC BY 4.0 |
| LinkModel | DirectLink |
| MeetingName | 10th Annual European Symposium on Algorithms (ESA 2002), Rome, Italy, September 17-21, 2002 |
| MergedId | FETCHMERGED-LOGICAL-c275t-108f612abe8a3f6ef9e5c08c78e79f14215b91b03d843b02f321ed9b8d972b533 |
| PageCount | 17 |
| ParticipantIDs | pascalfrancis_primary_17536539 crossref_primary_10_1007_s00453_005_1165_y crossref_citationtrail_10_1007_s00453_005_1165_y |
| PublicationCentury | 2000 |
| PublicationDate | 2005-07-01 |
| PublicationDateYYYYMMDD | 2005-07-01 |
| PublicationDate_xml | – month: 07 year: 2005 text: 2005-07-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY |
| PublicationTitle | Algorithmica |
| PublicationYear | 2005 |
| Publisher | Springer |
| Publisher_xml | – name: Springer |
| SSID | ssj0012796 |
| Score | 2.0542114 |
| SourceID | pascalfrancis crossref |
| SourceType | Index Database Enrichment Source |
| StartPage | 203 |
| SubjectTerms | Algorithmics. Computability. Computer arithmetics Applied sciences Artificial intelligence Computer science; control theory; systems Exact sciences and technology Pattern recognition. Digital image processing. Computational geometry Theoretical computing |
| Title | Near-Linear Time Approximation Algorithms for Curve Simplification |
| Volume | 42 |
| WOSCitedRecordID | wos000229801600002&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 | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1432-0541 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012796 issn: 0178-4617 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1dS8MwFA0yfBDE-YnzY-TBJyGQNk0_Hudw-CBDnMreSpMmWpjbaLvh_r03abc5FGFPfekN5STNPclNzkHoBkiIn3hcERVIabZuPJJwT5FIU80Yp6kW1rXkMej3w-EwelrrbP-u4Fu5T86IVcx0fE4WMN86vmvcCp4Hb6uKgRtYLy7jNk88SMvLCuZfLWzkoP1pUgAcuvKx-JFces2tPusQHdQcEneqTj9CO2p8jJpLfwZc_64n6K4Pw5jAahMe2Nz1wB2jIP6VVdcVcWf0Psmz8uOzwEBdcXeWzxUeZOaMua638k7Ra-_-pftAas8EIt2AlzCrhhpISyJUmDDtKx0pLmkog1AFkXY8yPAicgRlaegxQV3NXEelkQjTKHAFcL8z1BhPxuocYaoSljpGHx04APW0SKSgPkQY2SkhRQvRJYqxrAXFja_FKF5JIVuMYsAoNhjFixa6XYVMKzWN_15ub3TNOgKWWEZR92Kb1i7RnlVdtSdtr1CjzGfqGu3KeZkVeduOpW_e98CO |
| linkProvider | Springer Nature |
| 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%3Ajournal&rft.genre=proceeding&rft.title=Algorithmica&rft.atitle=Near-linear+time+approximation+algorithms+for+curve+simplification&rft.au=AGARWAL%2C+Pankaj+K&rft.au=HAR-PELED%2C+Sariel&rft.au=MUSTAFA%2C+Nabil+H&rft.au=YUSU+WANG&rft.date=2005-07-01&rft.pub=Springer&rft.issn=0178-4617&rft.volume=42&rft.issue=3-4&rft.spage=203&rft.epage=219&rft_id=info:doi/10.1007%2Fs00453-005-1165-y&rft.externalDBID=n%2Fa&rft.externalDocID=17536539 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon |