{"id":"https://openalex.org/W1981507524","doi":"https://doi.org/10.1007/s00453-001-0096-5","title":"Efficiently Approximating Polygonal Paths in Three and Higher Dimensions","display_name":"Efficiently Approximating Polygonal Paths in Three and Higher Dimensions","publication_year":2002,"publication_date":"2002-06-01","ids":{"openalex":"https://openalex.org/W1981507524","doi":"https://doi.org/10.1007/s00453-001-0096-5","mag":"1981507524"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-001-0096-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-001-0096-5","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059958789","display_name":"Gill Barequet","orcid":"https://orcid.org/0000-0001-7501-6240"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]},{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["IL","US"],"is_corresponding":true,"raw_author_name":"G. Barequet","raw_affiliation_strings":["Center for Geometric Computing, Department of Computer  Science, Johns Hopkins University, Baltimore, MD 21218, USA. {barequet,goodrich}@cs.jhu.edu. (The first author is currently affiliated with the Faculty of Computer Science at The Technion\u2014Israel Institute of Technology.), US"],"affiliations":[{"raw_affiliation_string":"Center for Geometric Computing, Department of Computer  Science, Johns Hopkins University, Baltimore, MD 21218, USA. {barequet,goodrich}@cs.jhu.edu. (The first author is currently affiliated with the Faculty of Computer Science at The Technion\u2014Israel Institute of Technology.), US","institution_ids":["https://openalex.org/I174306211","https://openalex.org/I145311948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035133713","display_name":"D. Z. Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Z. Chen","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. {chen,odaescu}@cse.nd.edu., US"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. {chen,odaescu}@cse.nd.edu., US","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078438902","display_name":"Ovidiu Daescu","orcid":"https://orcid.org/0000-0002-0278-4174"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"O. Daescu","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. {chen,odaescu}@cse.nd.edu., US"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. {chen,odaescu}@cse.nd.edu., US","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034971300","display_name":"Michael T. Goodrich","orcid":"https://orcid.org/0000-0002-8943-191X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]},{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"M. T. Goodrich","raw_affiliation_strings":["Center for Geometric Computing, Department of Computer  Science, Johns Hopkins University, Baltimore, MD 21218, USA. {barequet,goodrich}@cs.jhu.edu. (The first author is currently affiliated with the Faculty of Computer Science at The Technion\u2014Israel Institute of Technology.), US"],"affiliations":[{"raw_affiliation_string":"Center for Geometric Computing, Department of Computer  Science, Johns Hopkins University, Baltimore, MD 21218, USA. {barequet,goodrich}@cs.jhu.edu. (The first author is currently affiliated with the Faculty of Computer Science at The Technion\u2014Israel Institute of Technology.), US","institution_ids":["https://openalex.org/I174306211","https://openalex.org/I145311948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074061303","display_name":"Jack Snoeyink","orcid":"https://orcid.org/0000-0002-3887-4008"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Snoeyink","raw_affiliation_strings":["Department of Computer Science, University of North Carolina at Chapel Hill, NC 27599\u20143175, USA. snoeyink@cs.unc.edu., US"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Carolina at Chapel Hill, NC 27599\u20143175, USA. snoeyink@cs.unc.edu., US","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5059958789"],"corresponding_institution_ids":["https://openalex.org/I145311948","https://openalex.org/I174306211"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.4503,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.94314381,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"33","issue":"2","first_page":"150","last_page":"167"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12698","display_name":"3D Modeling in Geospatial Applications","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7680796384811401},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7323707342147827},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6191868782043457},{"id":"https://openalex.org/keywords/polygonal-chain","display_name":"Polygonal chain","score":0.6019123792648315},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.6011214256286621},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5721539258956909},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.47534772753715515},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45695945620536804},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4554883539676666},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.45400145649909973},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3383234739303589},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2872017025947571},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2007591426372528},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.16562747955322266},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11250084638595581},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0912037193775177}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7680796384811401},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7323707342147827},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6191868782043457},{"id":"https://openalex.org/C182860218","wikidata":"https://www.wikidata.org/wiki/Q633674","display_name":"Polygonal chain","level":3,"score":0.6019123792648315},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.6011214256286621},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5721539258956909},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.47534772753715515},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45695945620536804},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4554883539676666},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.45400145649909973},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3383234739303589},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2872017025947571},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2007591426372528},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.16562747955322266},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11250084638595581},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0912037193775177},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s00453-001-0096-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-001-0096-5","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.125.8802","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.8802","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/~goodrich/pubs/cap-alg.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.7076","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.7076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.technion.ac.il/pub/barequet/papers/cap-alg.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.39.3427","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.3427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nd.edu/~odaescu/././socg98.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.6884","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.6884","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.technion.ac.il/pub/barequet/papers/cap-socg98.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W13547501","https://openalex.org/W1541607068","https://openalex.org/W1553203695","https://openalex.org/W1561671573","https://openalex.org/W1958385715","https://openalex.org/W1965146563","https://openalex.org/W1972908733","https://openalex.org/W1974726020","https://openalex.org/W1981934656","https://openalex.org/W1984482678","https://openalex.org/W2001145975","https://openalex.org/W2006614694","https://openalex.org/W2009906570","https://openalex.org/W2038636610","https://openalex.org/W2048308679","https://openalex.org/W2058127000","https://openalex.org/W2071867759","https://openalex.org/W2084097355","https://openalex.org/W2097004206","https://openalex.org/W2146306925","https://openalex.org/W2155239911","https://openalex.org/W2172137407","https://openalex.org/W2172144276"],"related_works":["https://openalex.org/W4225349735","https://openalex.org/W4285255549","https://openalex.org/W2289394377","https://openalex.org/W4301184965","https://openalex.org/W2774812487","https://openalex.org/W2164240161","https://openalex.org/W4294527475","https://openalex.org/W2808192002","https://openalex.org/W2005560767","https://openalex.org/W1981507524"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}