{"id":"https://openalex.org/W7128401399","doi":"https://doi.org/10.48550/arxiv.2602.06590","title":"An Integer Linear Programming Approach to Geometrically Consistent Partial-Partial Shape Matching","display_name":"An Integer Linear Programming Approach to Geometrically Consistent Partial-Partial Shape Matching","publication_year":2026,"publication_date":"2026-02-06","ids":{"openalex":"https://openalex.org/W7128401399","doi":"https://doi.org/10.48550/arxiv.2602.06590"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.06590","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017619216","display_name":"Viktoria Ehm","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ehm, Viktoria","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123544890","display_name":"Paul Roetzer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roetzer, Paul","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125381225","display_name":"Florian Bernard","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bernard, Florian","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5125423089","display_name":"Daniel Cremers","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cremers, Daniel","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5017619216"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T10719","display_name":"3D Shape Modeling and Analysis","score":0.8420000076293945,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10719","display_name":"3D Shape Modeling and Analysis","score":0.8420000076293945,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10052","display_name":"Medical Image Segmentation Techniques","score":0.0284000001847744,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.01979999989271164,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"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/matching","display_name":"Matching (statistics)","score":0.6310999989509583},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6294000148773193},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6071000099182129},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.5697000026702881},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5404000282287598},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4440000057220459}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6310999989509583},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6294000148773193},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6071000099182129},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.5697000026702881},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5404000282287598},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5217000246047974},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48750001192092896},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4440000057220459},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.44040000438690186},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.41940000653266907},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41839998960494995},{"id":"https://openalex.org/C112604564","wikidata":"https://www.wikidata.org/wiki/Q7489226","display_name":"Shape analysis (program analysis)","level":3,"score":0.41130000352859497},{"id":"https://openalex.org/C7305733","wikidata":"https://www.wikidata.org/wiki/Q207961","display_name":"Geometric shape","level":2,"score":0.32010000944137573},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31690001487731934},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31049999594688416},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30140000581741333},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.27810001373291016},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26739999651908875}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.06590","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.06590","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.06590","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.06590","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"score":0.7335152626037598,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"task":[1],"of":[2,30,101,118,124,140],"establishing":[3],"correspondences":[4,48],"between":[5],"two":[6],"3D":[7,23,61,76],"shapes":[8,78],"is":[9,151],"a":[10,27,111],"long-standing":[11],"challenge":[12],"in":[13,70,138],"computer":[14],"vision.":[15],"While":[16],"numerous":[17],"studies":[18],"address":[19,97],"full-full":[20],"and":[21,122,143],"partial-full":[22],"shape":[24,62,103],"matching,":[25],"only":[26,80],"limited":[28],"number":[29],"works":[31],"have":[32],"explored":[33],"the":[34,51,55,65,88,98,119],"partial-partial":[35,60,102],"setting,":[36,68],"very":[37],"likely":[38],"due":[39],"to":[40,96],"its":[41],"unique":[42],"challenges:":[43],"we":[44,86,146],"must":[45],"compute":[46],"accurate":[47],"while":[49],"at":[50],"same":[52],"time":[53],"find":[54],"unknown":[56],"overlapping":[57,120],"region.":[58],"Nevertheless,":[59],"matching":[63,135,141],"reflects":[64],"most":[66],"realistic":[67],"as":[69,75,110],"many":[71],"real-world":[72],"cases,":[73],"such":[74],"scanning,":[77],"are":[79],"partially":[81],"observable.":[82],"In":[83],"this":[84],"work,":[85],"introduce":[87],"first":[89],"integer":[90],"linear":[91],"programming":[92],"approach":[93,132],"specifically":[94],"designed":[95],"distinctive":[99],"challenges":[100],"matching.":[104],"Our":[105],"method":[106,150],"leverages":[107],"geometric":[108],"consistency":[109],"strong":[112],"prior,":[113],"enabling":[114],"both":[115,137],"robust":[116],"estimation":[117],"region":[121],"computation":[123],"neighbourhood-preserving":[125],"correspondences.":[126],"We":[127],"empirically":[128],"demonstrate":[129],"that":[130,148],"our":[131,149],"achieves":[133],"high-quality":[134],"results":[136],"terms":[139],"error":[142],"smoothness.":[144],"Moreover,":[145],"show":[147],"more":[152],"scalable":[153],"than":[154],"previous":[155],"formalisms.":[156]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-10T00:00:00"}