{"id":"https://openalex.org/W1517063200","doi":"https://doi.org/10.1007/978-3-540-30538-5_25","title":"Minimum weight pseudo-triangulations (Extended abstract)","display_name":"Minimum weight pseudo-triangulations (Extended abstract)","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1517063200","doi":"https://doi.org/10.1007/978-3-540-30538-5_25","mag":"1517063200"},"language":"en","primary_location":{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/e353ad34-cb44-4b67-ae10-31775edbf2cd","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/e353ad34-cb44-4b67-ae10-31775edbf2cd","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gudmundsson, J & Levcopoulos, C 2004, Minimum weight pseudo-triangulations (Extended abstract). in K Lodaya & M Mahajan (eds), Foundations of Software Technology and Theoretical Computer Science (Proceedings 24th Conference, FSTTCS 2004, Chennai, India, December 16-18, 2004). Lecture Notes in Computer Science, vol. 3328, Springer, Berlin, pp. 299-310. https://doi.org/10.1007/978-3-540-30538-5_25","raw_type":"info:eu-repo/semantics/publishedVersion"},"type":"conference-paper","indexed_in":[],"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/A5087003217","display_name":"Joachim Gudmundsson","orcid":"https://orcid.org/0000-0002-6778-7990"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joachim Gudmundsson","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-6778-7990","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5005407145","display_name":"Christos Levcopoulos","orcid":"https://orcid.org/0000-0003-0983-7862"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christos Levcopoulos","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-0983-7862","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03658537,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991999864578247,"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":0.9991999864578247,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.980400025844574,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.8826777935028076},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.7924673557281494},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7761139869689941},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7720392942428589},{"id":"https://openalex.org/keywords/pitteway-triangulation","display_name":"Pitteway triangulation","score":0.7003192901611328},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6611340641975403},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.6448008418083191},{"id":"https://openalex.org/keywords/point-set-triangulation","display_name":"Point set triangulation","score":0.6423317193984985},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5990769863128662},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.47910311818122864},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.4492114186286926},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.44037148356437683},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4393164813518524},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.43529918789863586},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4351723790168762},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4184038043022156},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3569015860557556},{"id":"https://openalex.org/keywords/bowyer\u2013watson-algorithm","display_name":"Bowyer\u2013Watson algorithm","score":0.30872446298599243},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28285887837409973},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1665162742137909},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.15019294619560242},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08901968598365784}],"concepts":[{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.8826777935028076},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.7924673557281494},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7761139869689941},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7720392942428589},{"id":"https://openalex.org/C178609930","wikidata":"https://www.wikidata.org/wiki/Q3538712","display_name":"Pitteway triangulation","level":3,"score":0.7003192901611328},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6611340641975403},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.6448008418083191},{"id":"https://openalex.org/C167117609","wikidata":"https://www.wikidata.org/wiki/Q17078161","display_name":"Point set triangulation","level":3,"score":0.6423317193984985},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5990769863128662},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.47910311818122864},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.4492114186286926},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.44037148356437683},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4393164813518524},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.43529918789863586},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4351723790168762},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4184038043022156},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3569015860557556},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.30872446298599243},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28285887837409973},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1665162742137909},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.15019294619560242},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08901968598365784},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/e353ad34-cb44-4b67-ae10-31775edbf2cd","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/e353ad34-cb44-4b67-ae10-31775edbf2cd","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gudmundsson, J & Levcopoulos, C 2004, Minimum weight pseudo-triangulations (Extended abstract). in K Lodaya & M Mahajan (eds), Foundations of Software Technology and Theoretical Computer Science (Proceedings 24th Conference, FSTTCS 2004, Chennai, India, December 16-18, 2004). Lecture Notes in Computer Science, vol. 3328, Springer, Berlin, pp. 299-310. https://doi.org/10.1007/978-3-540-30538-5_25","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:665186","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=665186","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.107.198","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.198","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.win.tue.nl/~hgudmund/HP_links/PAPERS/FSTTCS04.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:665186","is_oa":false,"landing_page_url":"http://repository.tue.nl/665186","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:tue:oai:pure.tue.nl:publications/e353ad34-cb44-4b67-ae10-31775edbf2cd","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/e353ad34-cb44-4b67-ae10-31775edbf2cd","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Foundations of Software Technology and Theoretical Computer Science (Proceedings 24th Conference, FSTTCS 2004, Chennai, India, December 16-18, 2004), 299 - 310","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"mag:1517063200","is_oa":false,"landing_page_url":"https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2Fe353ad34-cb44-4b67-ae10-31775edbf2cd","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/13","score":0.5600000023841858,"display_name":"Climate action"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1491725382","https://openalex.org/W1526955206","https://openalex.org/W1547668367","https://openalex.org/W1998566446","https://openalex.org/W2008028882","https://openalex.org/W2015425624","https://openalex.org/W2053335419","https://openalex.org/W2072698009","https://openalex.org/W2078983270","https://openalex.org/W2084097355","https://openalex.org/W2091876670","https://openalex.org/W2103342896","https://openalex.org/W2106378227","https://openalex.org/W2147097381","https://openalex.org/W2160347332"],"related_works":["https://openalex.org/W990569426","https://openalex.org/W2059588548","https://openalex.org/W2790570572","https://openalex.org/W1964787778","https://openalex.org/W3105802762","https://openalex.org/W3159910038","https://openalex.org/W1484119165","https://openalex.org/W2295800032","https://openalex.org/W2084822306","https://openalex.org/W1584687374","https://openalex.org/W2073116298","https://openalex.org/W762237670","https://openalex.org/W3121701042","https://openalex.org/W2176967780","https://openalex.org/W2258521185","https://openalex.org/W2010303431","https://openalex.org/W2952188679","https://openalex.org/W2125961713","https://openalex.org/W2565603695","https://openalex.org/W1608900095"],"abstract_inverted_index":{"Abstract.":[0],"We":[1,21,76],"consider":[2],"the":[3,19,67,89],"problem":[4],"of":[5,11,15,33,69,74,101],"computing":[6],"a":[7,12,31,50,70,79,97,102],"minimum":[8,71,98],"weight":[9,34,59,68,99],"pseudo-triangulation":[10,32,100],"set":[13,52],"S":[14,53],"n":[16,61],"points":[17],"in":[18,85],"plane.":[20],"first":[22],"present":[23,78],"an":[24,93],"O(n":[25],"log":[26,37],"n)-time":[27],"algorithm":[28,83,94],"that":[29,95],"produces":[30,96],"O(wt(M(S))":[35],"\u00b7":[36,62],"n)":[38],"which":[39,55],"is":[40,66],"shown":[41],"to":[42],"be":[43],"asymptotically":[44],"worstcase":[45],"optimal,":[46],"i.e.,":[47],"there":[48],"exists":[49],"point":[51],"for":[54],"every":[56],"pseudotriangulation":[57],"has":[58],"\u2126(log":[60],"wt(M(S))),":[63],"where":[64],"wt(M(S))":[65],"spanning":[72],"tree":[73],"S.":[75],"also":[77],"constant":[80],"factor":[81],"approximation":[82],"running":[84],"cubic":[86],"time.":[87],"In":[88],"process":[90],"we":[91],"give":[92],"simple":[103],"polygon.":[104],"1":[105]},"counts_by_year":[],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}