A quasi-visibility graph based clique-extraction heuristic model for partitioning of planar shape Article Swipe
Sourav Saha
,
Ankita Mandal
,
Sayantan Rana
,
Priya Ranjan Sinha Mahapatra
·
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.1504/ijams.2019.096654
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.1504/ijams.2019.096654
This paper presents a graph theoretical model to partition polygonal approximation of a shape into visually meaningful constituent parts based on a heuristic approach. The proposed model introduces a new concept of approximated vertex-visibility graph termed as quasi-visibility graph to generate different viable cuts for partitioning the shape. In the shape representative graph, a maximal-clique perceptually corresponds to a distinguishable part. Based on this notion, we propose a heuristic based clique extraction strategy to decompose the shape exploring its quasi-visibility graph. A few refinement strategies are also attempted by exploring the options of: a) merging correlated parts for better visual interpretation; b) inserting antipodal points of reflex vertices in polygonal approximation for more possible viable cuts. The performance of the proposed model is evaluated by comparing partition-graphs of similar shapes. The partitioning based on the proposed model appears to be coherent with human observation and comparable with existing algorithms.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1504/ijams.2019.096654
- https://doi.org/10.1504/ijams.2019.096654
- OA Status
- bronze
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4246738045
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4246738045Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1504/ijams.2019.096654Digital Object Identifier
- Title
-
A quasi-visibility graph based clique-extraction heuristic model for partitioning of planar shapeWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2018Year of publication
- Publication date
-
2018-12-08Full publication date if available
- Authors
-
Sourav Saha, Ankita Mandal, Sayantan Rana, Priya Ranjan Sinha MahapatraList of authors in order
- Landing page
-
https://doi.org/10.1504/ijams.2019.096654Publisher landing page
- PDF URL
-
https://doi.org/10.1504/ijams.2019.096654Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
bronzeOpen access status per OpenAlex
- OA URL
-
https://doi.org/10.1504/ijams.2019.096654Direct OA link when available
- Concepts
-
Antipodal point, Visibility graph, Visibility, Computer science, Heuristic, Vertex (graph theory), Partition (number theory), Graph, Graph partition, Combinatorics, Algorithm, Mathematics, Theoretical computer science, Artificial intelligence, Geometry, Regular polygon, Optics, PhysicsTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4246738045 |
|---|---|
| doi | https://doi.org/10.1504/ijams.2019.096654 |
| ids.doi | https://doi.org/10.1504/ijams.2019.096654 |
| ids.openalex | https://openalex.org/W4246738045 |
| fwci | 0.0 |
| type | article |
| title | A quasi-visibility graph based clique-extraction heuristic model for partitioning of planar shape |
| biblio.issue | 1 |
| biblio.volume | 11 |
| biblio.last_page | 36 |
| biblio.first_page | 36 |
| topics[0].id | https://openalex.org/T10481 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9926999807357788 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1704 |
| topics[0].subfield.display_name | Computer Graphics and Computer-Aided Design |
| topics[0].display_name | Computer Graphics and Visualization Techniques |
| topics[1].id | https://openalex.org/T11211 |
| topics[1].field.id | https://openalex.org/fields/19 |
| topics[1].field.display_name | Earth and Planetary Sciences |
| topics[1].score | 0.9866999983787537 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1907 |
| topics[1].subfield.display_name | Geology |
| topics[1].display_name | 3D Surveying and Cultural Heritage |
| topics[2].id | https://openalex.org/T11605 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9815999865531921 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1707 |
| topics[2].subfield.display_name | Computer Vision and Pattern Recognition |
| topics[2].display_name | Visual Attention and Saliency Detection |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C70943382 |
| concepts[0].level | 2 |
| concepts[0].score | 0.6946759819984436 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q505356 |
| concepts[0].display_name | Antipodal point |
| concepts[1].id | https://openalex.org/C173362246 |
| concepts[1].level | 3 |
| concepts[1].score | 0.6617988348007202 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q8216024 |
| concepts[1].display_name | Visibility graph |
| concepts[2].id | https://openalex.org/C123403432 |
| concepts[2].level | 2 |
| concepts[2].score | 0.604037880897522 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q654068 |
| concepts[2].display_name | Visibility |
| concepts[3].id | https://openalex.org/C41008148 |
| concepts[3].level | 0 |
| concepts[3].score | 0.5553916692733765 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[3].display_name | Computer science |
| concepts[4].id | https://openalex.org/C173801870 |
| concepts[4].level | 2 |
| concepts[4].score | 0.5386331677436829 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q201413 |
| concepts[4].display_name | Heuristic |
| concepts[5].id | https://openalex.org/C80899671 |
| concepts[5].level | 3 |
| concepts[5].score | 0.4883427321910858 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q1304193 |
| concepts[5].display_name | Vertex (graph theory) |
| concepts[6].id | https://openalex.org/C42812 |
| concepts[6].level | 2 |
| concepts[6].score | 0.46692582964897156 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q1082910 |
| concepts[6].display_name | Partition (number theory) |
| concepts[7].id | https://openalex.org/C132525143 |
| concepts[7].level | 2 |
| concepts[7].score | 0.45883315801620483 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q141488 |
| concepts[7].display_name | Graph |
| concepts[8].id | https://openalex.org/C48903430 |
| concepts[8].level | 3 |
| concepts[8].score | 0.42085087299346924 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q491370 |
| concepts[8].display_name | Graph partition |
| concepts[9].id | https://openalex.org/C114614502 |
| concepts[9].level | 1 |
| concepts[9].score | 0.38545554876327515 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q76592 |
| concepts[9].display_name | Combinatorics |
| concepts[10].id | https://openalex.org/C11413529 |
| concepts[10].level | 1 |
| concepts[10].score | 0.36501848697662354 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[10].display_name | Algorithm |
| concepts[11].id | https://openalex.org/C33923547 |
| concepts[11].level | 0 |
| concepts[11].score | 0.3337133526802063 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[11].display_name | Mathematics |
| concepts[12].id | https://openalex.org/C80444323 |
| concepts[12].level | 1 |
| concepts[12].score | 0.3264027237892151 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[12].display_name | Theoretical computer science |
| concepts[13].id | https://openalex.org/C154945302 |
| concepts[13].level | 1 |
| concepts[13].score | 0.3051215708255768 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[13].display_name | Artificial intelligence |
| concepts[14].id | https://openalex.org/C2524010 |
| concepts[14].level | 1 |
| concepts[14].score | 0.12406235933303833 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[14].display_name | Geometry |
| concepts[15].id | https://openalex.org/C112680207 |
| concepts[15].level | 2 |
| concepts[15].score | 0.1087411642074585 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q714886 |
| concepts[15].display_name | Regular polygon |
| concepts[16].id | https://openalex.org/C120665830 |
| concepts[16].level | 1 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q14620 |
| concepts[16].display_name | Optics |
| concepts[17].id | https://openalex.org/C121332964 |
| concepts[17].level | 0 |
| concepts[17].score | 0.0 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q413 |
| concepts[17].display_name | Physics |
| keywords[0].id | https://openalex.org/keywords/antipodal-point |
| keywords[0].score | 0.6946759819984436 |
| keywords[0].display_name | Antipodal point |
| keywords[1].id | https://openalex.org/keywords/visibility-graph |
| keywords[1].score | 0.6617988348007202 |
| keywords[1].display_name | Visibility graph |
| keywords[2].id | https://openalex.org/keywords/visibility |
| keywords[2].score | 0.604037880897522 |
| keywords[2].display_name | Visibility |
| keywords[3].id | https://openalex.org/keywords/computer-science |
| keywords[3].score | 0.5553916692733765 |
| keywords[3].display_name | Computer science |
| keywords[4].id | https://openalex.org/keywords/heuristic |
| keywords[4].score | 0.5386331677436829 |
| keywords[4].display_name | Heuristic |
| keywords[5].id | https://openalex.org/keywords/vertex |
| keywords[5].score | 0.4883427321910858 |
| keywords[5].display_name | Vertex (graph theory) |
| keywords[6].id | https://openalex.org/keywords/partition |
| keywords[6].score | 0.46692582964897156 |
| keywords[6].display_name | Partition (number theory) |
| keywords[7].id | https://openalex.org/keywords/graph |
| keywords[7].score | 0.45883315801620483 |
| keywords[7].display_name | Graph |
| keywords[8].id | https://openalex.org/keywords/graph-partition |
| keywords[8].score | 0.42085087299346924 |
| keywords[8].display_name | Graph partition |
| keywords[9].id | https://openalex.org/keywords/combinatorics |
| keywords[9].score | 0.38545554876327515 |
| keywords[9].display_name | Combinatorics |
| keywords[10].id | https://openalex.org/keywords/algorithm |
| keywords[10].score | 0.36501848697662354 |
| keywords[10].display_name | Algorithm |
| keywords[11].id | https://openalex.org/keywords/mathematics |
| keywords[11].score | 0.3337133526802063 |
| keywords[11].display_name | Mathematics |
| keywords[12].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[12].score | 0.3264027237892151 |
| keywords[12].display_name | Theoretical computer science |
| keywords[13].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[13].score | 0.3051215708255768 |
| keywords[13].display_name | Artificial intelligence |
| keywords[14].id | https://openalex.org/keywords/geometry |
| keywords[14].score | 0.12406235933303833 |
| keywords[14].display_name | Geometry |
| keywords[15].id | https://openalex.org/keywords/regular-polygon |
| keywords[15].score | 0.1087411642074585 |
| keywords[15].display_name | Regular polygon |
| language | en |
| locations[0].id | doi:10.1504/ijams.2019.096654 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S199699369 |
| locations[0].source.issn | 1755-8913, 1755-8921 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | 1755-8913 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | International Journal of Applied Management Science |
| locations[0].source.host_organization | https://openalex.org/P4310317825 |
| locations[0].source.host_organization_name | Inderscience Publishers |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310317825 |
| locations[0].source.host_organization_lineage_names | Inderscience Publishers |
| locations[0].license | |
| locations[0].pdf_url | https://doi.org/10.1504/ijams.2019.096654 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | International Journal of Applied Management Science |
| locations[0].landing_page_url | https://doi.org/10.1504/ijams.2019.096654 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5051854259 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-7242-5540 |
| authorships[0].author.display_name | Sourav Saha |
| authorships[0].countries | IN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I1296725772 |
| authorships[0].affiliations[0].raw_affiliation_string | Department of Computer Science, Institute of Engineering & Management, Kolkata, India |
| authorships[0].institutions[0].id | https://openalex.org/I1296725772 |
| authorships[0].institutions[0].ror | https://ror.org/02decng19 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I1296725772 |
| authorships[0].institutions[0].country_code | IN |
| authorships[0].institutions[0].display_name | University of Engineering & Management |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Sourav Saha |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Department of Computer Science, Institute of Engineering & Management, Kolkata, India |
| authorships[1].author.id | https://openalex.org/A5084469496 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-2785-7915 |
| authorships[1].author.display_name | Ankita Mandal |
| authorships[1].countries | IN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I1296725772 |
| authorships[1].affiliations[0].raw_affiliation_string | Department of Computer Science, Institute of Engineering & Management, Kolkata, India |
| authorships[1].institutions[0].id | https://openalex.org/I1296725772 |
| authorships[1].institutions[0].ror | https://ror.org/02decng19 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I1296725772 |
| authorships[1].institutions[0].country_code | IN |
| authorships[1].institutions[0].display_name | University of Engineering & Management |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Ankita Mandal |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Department of Computer Science, Institute of Engineering & Management, Kolkata, India |
| authorships[2].author.id | https://openalex.org/A5022244477 |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | Sayantan Rana |
| authorships[2].countries | IN |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I1296725772 |
| authorships[2].affiliations[0].raw_affiliation_string | Department of Computer Science, Institute of Engineering & Management, Kolkata, India |
| authorships[2].institutions[0].id | https://openalex.org/I1296725772 |
| authorships[2].institutions[0].ror | https://ror.org/02decng19 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I1296725772 |
| authorships[2].institutions[0].country_code | IN |
| authorships[2].institutions[0].display_name | University of Engineering & Management |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Sayantan Rana |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Department of Computer Science, Institute of Engineering & Management, Kolkata, India |
| authorships[3].author.id | https://openalex.org/A5069174129 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-6943-3934 |
| authorships[3].author.display_name | Priya Ranjan Sinha Mahapatra |
| authorships[3].countries | IN |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I1296725772 |
| authorships[3].affiliations[0].raw_affiliation_string | Department of Computer Science, Institute of Engineering & Management, Kolkata, India |
| authorships[3].institutions[0].id | https://openalex.org/I1296725772 |
| authorships[3].institutions[0].ror | https://ror.org/02decng19 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I1296725772 |
| authorships[3].institutions[0].country_code | IN |
| authorships[3].institutions[0].display_name | University of Engineering & Management |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Priya Ranjan Sinha Mahapatra |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | Department of Computer Science, Institute of Engineering & Management, Kolkata, India |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://doi.org/10.1504/ijams.2019.096654 |
| open_access.oa_status | bronze |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | A quasi-visibility graph based clique-extraction heuristic model for partitioning of planar shape |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10481 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9926999807357788 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1704 |
| primary_topic.subfield.display_name | Computer Graphics and Computer-Aided Design |
| primary_topic.display_name | Computer Graphics and Visualization Techniques |
| related_works | https://openalex.org/W2743652671, https://openalex.org/W2911638885, https://openalex.org/W2032709970, https://openalex.org/W2066813664, https://openalex.org/W2519024191, https://openalex.org/W2159176266, https://openalex.org/W2963183586, https://openalex.org/W2094166299, https://openalex.org/W4388826510, https://openalex.org/W2583811263 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.1504/ijams.2019.096654 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S199699369 |
| best_oa_location.source.issn | 1755-8913, 1755-8921 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | 1755-8913 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | International Journal of Applied Management Science |
| best_oa_location.source.host_organization | https://openalex.org/P4310317825 |
| best_oa_location.source.host_organization_name | Inderscience Publishers |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310317825 |
| best_oa_location.source.host_organization_lineage_names | Inderscience Publishers |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://doi.org/10.1504/ijams.2019.096654 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | International Journal of Applied Management Science |
| best_oa_location.landing_page_url | https://doi.org/10.1504/ijams.2019.096654 |
| primary_location.id | doi:10.1504/ijams.2019.096654 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S199699369 |
| primary_location.source.issn | 1755-8913, 1755-8921 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | 1755-8913 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | International Journal of Applied Management Science |
| primary_location.source.host_organization | https://openalex.org/P4310317825 |
| primary_location.source.host_organization_name | Inderscience Publishers |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310317825 |
| primary_location.source.host_organization_lineage_names | Inderscience Publishers |
| primary_location.license | |
| primary_location.pdf_url | https://doi.org/10.1504/ijams.2019.096654 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | International Journal of Applied Management Science |
| primary_location.landing_page_url | https://doi.org/10.1504/ijams.2019.096654 |
| publication_date | 2018-12-08 |
| publication_year | 2018 |
| referenced_works_count | 0 |
| abstract_inverted_index.A | 81 |
| abstract_inverted_index.a | 3, 12, 21, 28, 53, 58, 67 |
| abstract_inverted_index.In | 48 |
| abstract_inverted_index.a) | 93 |
| abstract_inverted_index.as | 36 |
| abstract_inverted_index.b) | 101 |
| abstract_inverted_index.be | 139 |
| abstract_inverted_index.by | 88, 124 |
| abstract_inverted_index.in | 108 |
| abstract_inverted_index.is | 122 |
| abstract_inverted_index.of | 11, 31, 105, 118, 127 |
| abstract_inverted_index.on | 20, 62, 133 |
| abstract_inverted_index.to | 7, 39, 57, 73, 138 |
| abstract_inverted_index.we | 65 |
| abstract_inverted_index.The | 24, 116, 130 |
| abstract_inverted_index.and | 144 |
| abstract_inverted_index.are | 85 |
| abstract_inverted_index.few | 82 |
| abstract_inverted_index.for | 44, 97, 111 |
| abstract_inverted_index.its | 78 |
| abstract_inverted_index.new | 29 |
| abstract_inverted_index.of: | 92 |
| abstract_inverted_index.the | 46, 49, 75, 90, 119, 134 |
| abstract_inverted_index.This | 0 |
| abstract_inverted_index.also | 86 |
| abstract_inverted_index.cuts | 43 |
| abstract_inverted_index.into | 14 |
| abstract_inverted_index.more | 112 |
| abstract_inverted_index.this | 63 |
| abstract_inverted_index.with | 141, 146 |
| abstract_inverted_index.Based | 61 |
| abstract_inverted_index.based | 19, 69, 132 |
| abstract_inverted_index.cuts. | 115 |
| abstract_inverted_index.graph | 4, 34, 38 |
| abstract_inverted_index.human | 142 |
| abstract_inverted_index.model | 6, 26, 121, 136 |
| abstract_inverted_index.paper | 1 |
| abstract_inverted_index.part. | 60 |
| abstract_inverted_index.parts | 18, 96 |
| abstract_inverted_index.shape | 13, 50, 76 |
| abstract_inverted_index.better | 98 |
| abstract_inverted_index.clique | 70 |
| abstract_inverted_index.graph, | 52 |
| abstract_inverted_index.graph. | 80 |
| abstract_inverted_index.points | 104 |
| abstract_inverted_index.reflex | 106 |
| abstract_inverted_index.shape. | 47 |
| abstract_inverted_index.termed | 35 |
| abstract_inverted_index.viable | 42, 114 |
| abstract_inverted_index.visual | 99 |
| abstract_inverted_index.appears | 137 |
| abstract_inverted_index.concept | 30 |
| abstract_inverted_index.merging | 94 |
| abstract_inverted_index.notion, | 64 |
| abstract_inverted_index.options | 91 |
| abstract_inverted_index.propose | 66 |
| abstract_inverted_index.shapes. | 129 |
| abstract_inverted_index.similar | 128 |
| abstract_inverted_index.coherent | 140 |
| abstract_inverted_index.existing | 147 |
| abstract_inverted_index.generate | 40 |
| abstract_inverted_index.possible | 113 |
| abstract_inverted_index.presents | 2 |
| abstract_inverted_index.proposed | 25, 120, 135 |
| abstract_inverted_index.strategy | 72 |
| abstract_inverted_index.vertices | 107 |
| abstract_inverted_index.visually | 15 |
| abstract_inverted_index.antipodal | 103 |
| abstract_inverted_index.approach. | 23 |
| abstract_inverted_index.attempted | 87 |
| abstract_inverted_index.comparing | 125 |
| abstract_inverted_index.decompose | 74 |
| abstract_inverted_index.different | 41 |
| abstract_inverted_index.evaluated | 123 |
| abstract_inverted_index.exploring | 77, 89 |
| abstract_inverted_index.heuristic | 22, 68 |
| abstract_inverted_index.inserting | 102 |
| abstract_inverted_index.partition | 8 |
| abstract_inverted_index.polygonal | 9, 109 |
| abstract_inverted_index.comparable | 145 |
| abstract_inverted_index.correlated | 95 |
| abstract_inverted_index.extraction | 71 |
| abstract_inverted_index.introduces | 27 |
| abstract_inverted_index.meaningful | 16 |
| abstract_inverted_index.refinement | 83 |
| abstract_inverted_index.strategies | 84 |
| abstract_inverted_index.algorithms. | 148 |
| abstract_inverted_index.constituent | 17 |
| abstract_inverted_index.corresponds | 56 |
| abstract_inverted_index.observation | 143 |
| abstract_inverted_index.performance | 117 |
| abstract_inverted_index.theoretical | 5 |
| abstract_inverted_index.approximated | 32 |
| abstract_inverted_index.partitioning | 45, 131 |
| abstract_inverted_index.perceptually | 55 |
| abstract_inverted_index.approximation | 10, 110 |
| abstract_inverted_index.maximal-clique | 54 |
| abstract_inverted_index.representative | 51 |
| abstract_inverted_index.distinguishable | 59 |
| abstract_inverted_index.interpretation; | 100 |
| abstract_inverted_index.partition-graphs | 126 |
| abstract_inverted_index.quasi-visibility | 37, 79 |
| abstract_inverted_index.vertex-visibility | 33 |
| cited_by_percentile_year | |
| countries_distinct_count | 1 |
| institutions_distinct_count | 4 |
| citation_normalized_percentile.value | 0.55160932 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |