Multi-Target Search in Euclidean Space with Ray Shooting (Full Version) Article Swipe
Ryan Hechenberger
,
Daniel Harabor
,
Muhammad Aamir Cheema
,
Peter J. Stuckey
,
Pierre Le Bodic
·
YOU?
·
· 2022
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2207.02436
YOU?
·
· 2022
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2207.02436
The Euclidean shortest path problem (ESPP) is a well studied problem with many practical applications. Recently a new efficient online approach to this problem, RayScan, has been developed, based on ray shooting and polygon scanning. In this paper we show how we can improve RayScan by carefully reasoning about polygon scans. We also look into how RayScan could be applied in the single-source multi-target scenario, where logic during scanning is used to reduce the number of rays shots required. This improvement also helps in the single target case. We compare the improved RayScan+ against the state-of-the-art ESPP algorithm, illustrating the situations where it is better.
Related Topics
Concepts
Polygon (computer graphics)
Computer science
Euclidean distance
Euclidean geometry
Algorithm
Path (computing)
Shortest path problem
Space (punctuation)
Computer vision
Computer graphics (images)
Artificial intelligence
Theoretical computer science
Mathematical optimization
Mathematics
Geometry
Programming language
Frame (networking)
Telecommunications
Graph
Operating system
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2207.02436
- https://arxiv.org/pdf/2207.02436
- OA Status
- green
- Cited By
- 3
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4284892159
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4284892159Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2207.02436Digital Object Identifier
- Title
-
Multi-Target Search in Euclidean Space with Ray Shooting (Full Version)Work title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2022Year of publication
- Publication date
-
2022-07-06Full publication date if available
- Authors
-
Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le BodicList of authors in order
- Landing page
-
https://arxiv.org/abs/2207.02436Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2207.02436Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2207.02436Direct OA link when available
- Concepts
-
Polygon (computer graphics), Computer science, Euclidean distance, Euclidean geometry, Algorithm, Path (computing), Shortest path problem, Space (punctuation), Computer vision, Computer graphics (images), Artificial intelligence, Theoretical computer science, Mathematical optimization, Mathematics, Geometry, Programming language, Frame (networking), Telecommunications, Graph, Operating systemTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
3Total citation count in OpenAlex
- Citations by year (recent)
-
2023: 2, 2021: 1Per-year citation counts (last 5 years)
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4284892159 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2207.02436 |
| ids.doi | https://doi.org/10.48550/arxiv.2207.02436 |
| ids.openalex | https://openalex.org/W4284892159 |
| fwci | |
| type | preprint |
| title | Multi-Target Search in Euclidean Space with Ray Shooting (Full Version) |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10586 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.991599977016449 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1707 |
| topics[0].subfield.display_name | Computer Vision and Pattern Recognition |
| topics[0].display_name | Robotic Path Planning Algorithms |
| topics[1].id | https://openalex.org/T12549 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.991100013256073 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1707 |
| topics[1].subfield.display_name | Computer Vision and Pattern Recognition |
| topics[1].display_name | Image and Object Detection Techniques |
| topics[2].id | https://openalex.org/T10191 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9825000166893005 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2202 |
| topics[2].subfield.display_name | Aerospace Engineering |
| topics[2].display_name | Robotics and Sensor-Based Localization |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C190694206 |
| concepts[0].level | 3 |
| concepts[0].score | 0.6362720727920532 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q3276654 |
| concepts[0].display_name | Polygon (computer graphics) |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.6286628246307373 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C120174047 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5285122394561768 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q847073 |
| concepts[2].display_name | Euclidean distance |
| concepts[3].id | https://openalex.org/C129782007 |
| concepts[3].level | 2 |
| concepts[3].score | 0.5190794467926025 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q162886 |
| concepts[3].display_name | Euclidean geometry |
| concepts[4].id | https://openalex.org/C11413529 |
| concepts[4].level | 1 |
| concepts[4].score | 0.493103951215744 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[4].display_name | Algorithm |
| concepts[5].id | https://openalex.org/C2777735758 |
| concepts[5].level | 2 |
| concepts[5].score | 0.47589218616485596 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q817765 |
| concepts[5].display_name | Path (computing) |
| concepts[6].id | https://openalex.org/C22590252 |
| concepts[6].level | 3 |
| concepts[6].score | 0.44618386030197144 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q1058754 |
| concepts[6].display_name | Shortest path problem |
| concepts[7].id | https://openalex.org/C2778572836 |
| concepts[7].level | 2 |
| concepts[7].score | 0.414112389087677 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q380933 |
| concepts[7].display_name | Space (punctuation) |
| concepts[8].id | https://openalex.org/C31972630 |
| concepts[8].level | 1 |
| concepts[8].score | 0.37163713574409485 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q844240 |
| concepts[8].display_name | Computer vision |
| concepts[9].id | https://openalex.org/C121684516 |
| concepts[9].level | 1 |
| concepts[9].score | 0.35875338315963745 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q7600677 |
| concepts[9].display_name | Computer graphics (images) |
| concepts[10].id | https://openalex.org/C154945302 |
| concepts[10].level | 1 |
| concepts[10].score | 0.35152801871299744 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[10].display_name | Artificial intelligence |
| concepts[11].id | https://openalex.org/C80444323 |
| concepts[11].level | 1 |
| concepts[11].score | 0.34045714139938354 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[11].display_name | Theoretical computer science |
| concepts[12].id | https://openalex.org/C126255220 |
| concepts[12].level | 1 |
| concepts[12].score | 0.3274015486240387 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[12].display_name | Mathematical optimization |
| concepts[13].id | https://openalex.org/C33923547 |
| concepts[13].level | 0 |
| concepts[13].score | 0.26034170389175415 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[13].display_name | Mathematics |
| concepts[14].id | https://openalex.org/C2524010 |
| concepts[14].level | 1 |
| concepts[14].score | 0.06061658263206482 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[14].display_name | Geometry |
| concepts[15].id | https://openalex.org/C199360897 |
| concepts[15].level | 1 |
| concepts[15].score | 0.05601850152015686 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[15].display_name | Programming language |
| concepts[16].id | https://openalex.org/C126042441 |
| concepts[16].level | 2 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q1324888 |
| concepts[16].display_name | Frame (networking) |
| concepts[17].id | https://openalex.org/C76155785 |
| concepts[17].level | 1 |
| concepts[17].score | 0.0 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q418 |
| concepts[17].display_name | Telecommunications |
| concepts[18].id | https://openalex.org/C132525143 |
| concepts[18].level | 2 |
| concepts[18].score | 0.0 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q141488 |
| concepts[18].display_name | Graph |
| concepts[19].id | https://openalex.org/C111919701 |
| concepts[19].level | 1 |
| concepts[19].score | 0.0 |
| concepts[19].wikidata | https://www.wikidata.org/wiki/Q9135 |
| concepts[19].display_name | Operating system |
| keywords[0].id | https://openalex.org/keywords/polygon |
| keywords[0].score | 0.6362720727920532 |
| keywords[0].display_name | Polygon (computer graphics) |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.6286628246307373 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/euclidean-distance |
| keywords[2].score | 0.5285122394561768 |
| keywords[2].display_name | Euclidean distance |
| keywords[3].id | https://openalex.org/keywords/euclidean-geometry |
| keywords[3].score | 0.5190794467926025 |
| keywords[3].display_name | Euclidean geometry |
| keywords[4].id | https://openalex.org/keywords/algorithm |
| keywords[4].score | 0.493103951215744 |
| keywords[4].display_name | Algorithm |
| keywords[5].id | https://openalex.org/keywords/path |
| keywords[5].score | 0.47589218616485596 |
| keywords[5].display_name | Path (computing) |
| keywords[6].id | https://openalex.org/keywords/shortest-path-problem |
| keywords[6].score | 0.44618386030197144 |
| keywords[6].display_name | Shortest path problem |
| keywords[7].id | https://openalex.org/keywords/space |
| keywords[7].score | 0.414112389087677 |
| keywords[7].display_name | Space (punctuation) |
| keywords[8].id | https://openalex.org/keywords/computer-vision |
| keywords[8].score | 0.37163713574409485 |
| keywords[8].display_name | Computer vision |
| keywords[9].id | https://openalex.org/keywords/computer-graphics |
| keywords[9].score | 0.35875338315963745 |
| keywords[9].display_name | Computer graphics (images) |
| keywords[10].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[10].score | 0.35152801871299744 |
| keywords[10].display_name | Artificial intelligence |
| keywords[11].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[11].score | 0.34045714139938354 |
| keywords[11].display_name | Theoretical computer science |
| keywords[12].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[12].score | 0.3274015486240387 |
| keywords[12].display_name | Mathematical optimization |
| keywords[13].id | https://openalex.org/keywords/mathematics |
| keywords[13].score | 0.26034170389175415 |
| keywords[13].display_name | Mathematics |
| keywords[14].id | https://openalex.org/keywords/geometry |
| keywords[14].score | 0.06061658263206482 |
| keywords[14].display_name | Geometry |
| keywords[15].id | https://openalex.org/keywords/programming-language |
| keywords[15].score | 0.05601850152015686 |
| keywords[15].display_name | Programming language |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2207.02436 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/2207.02436 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2207.02436 |
| locations[1].id | doi:10.48550/arxiv.2207.02436 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2207.02436 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5036836788 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Ryan Hechenberger |
| authorships[0].countries | AU |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I2801239119, https://openalex.org/I56590836 |
| authorships[0].affiliations[0].raw_affiliation_string | Monash University |
| authorships[0].institutions[0].id | https://openalex.org/I2801239119 |
| authorships[0].institutions[0].ror | https://ror.org/02qa5kg76 |
| authorships[0].institutions[0].type | facility |
| authorships[0].institutions[0].lineage | https://openalex.org/I2801037857, https://openalex.org/I2801239119, https://openalex.org/I56590836 |
| authorships[0].institutions[0].country_code | AU |
| authorships[0].institutions[0].display_name | Australian Regenerative Medicine Institute |
| authorships[0].institutions[1].id | https://openalex.org/I56590836 |
| authorships[0].institutions[1].ror | https://ror.org/02bfwt286 |
| authorships[0].institutions[1].type | education |
| authorships[0].institutions[1].lineage | https://openalex.org/I56590836 |
| authorships[0].institutions[1].country_code | AU |
| authorships[0].institutions[1].display_name | Monash University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Hechenberger, Ryan |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Monash University |
| authorships[1].author.id | https://openalex.org/A5035664456 |
| authorships[1].author.orcid | https://orcid.org/0000-0001-6828-7712 |
| authorships[1].author.display_name | Daniel Harabor |
| authorships[1].countries | AU |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I2801239119, https://openalex.org/I56590836 |
| authorships[1].affiliations[0].raw_affiliation_string | Monash University |
| authorships[1].institutions[0].id | https://openalex.org/I2801239119 |
| authorships[1].institutions[0].ror | https://ror.org/02qa5kg76 |
| authorships[1].institutions[0].type | facility |
| authorships[1].institutions[0].lineage | https://openalex.org/I2801037857, https://openalex.org/I2801239119, https://openalex.org/I56590836 |
| authorships[1].institutions[0].country_code | AU |
| authorships[1].institutions[0].display_name | Australian Regenerative Medicine Institute |
| authorships[1].institutions[1].id | https://openalex.org/I56590836 |
| authorships[1].institutions[1].ror | https://ror.org/02bfwt286 |
| authorships[1].institutions[1].type | education |
| authorships[1].institutions[1].lineage | https://openalex.org/I56590836 |
| authorships[1].institutions[1].country_code | AU |
| authorships[1].institutions[1].display_name | Monash University |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Harabor, Daniel |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Monash University |
| authorships[2].author.id | https://openalex.org/A5047549903 |
| authorships[2].author.orcid | https://orcid.org/0000-0003-2139-9121 |
| authorships[2].author.display_name | Muhammad Aamir Cheema |
| authorships[2].countries | AU |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I2801239119, https://openalex.org/I56590836 |
| authorships[2].affiliations[0].raw_affiliation_string | Monash University |
| authorships[2].institutions[0].id | https://openalex.org/I2801239119 |
| authorships[2].institutions[0].ror | https://ror.org/02qa5kg76 |
| authorships[2].institutions[0].type | facility |
| authorships[2].institutions[0].lineage | https://openalex.org/I2801037857, https://openalex.org/I2801239119, https://openalex.org/I56590836 |
| authorships[2].institutions[0].country_code | AU |
| authorships[2].institutions[0].display_name | Australian Regenerative Medicine Institute |
| authorships[2].institutions[1].id | https://openalex.org/I56590836 |
| authorships[2].institutions[1].ror | https://ror.org/02bfwt286 |
| authorships[2].institutions[1].type | education |
| authorships[2].institutions[1].lineage | https://openalex.org/I56590836 |
| authorships[2].institutions[1].country_code | AU |
| authorships[2].institutions[1].display_name | Monash University |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Cheema, Muhammad Aamir |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Monash University |
| authorships[3].author.id | https://openalex.org/A5064839018 |
| authorships[3].author.orcid | https://orcid.org/0000-0003-2186-0459 |
| authorships[3].author.display_name | Peter J. Stuckey |
| authorships[3].countries | AU |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I2801239119, https://openalex.org/I56590836 |
| authorships[3].affiliations[0].raw_affiliation_string | Monash University |
| authorships[3].institutions[0].id | https://openalex.org/I2801239119 |
| authorships[3].institutions[0].ror | https://ror.org/02qa5kg76 |
| authorships[3].institutions[0].type | facility |
| authorships[3].institutions[0].lineage | https://openalex.org/I2801037857, https://openalex.org/I2801239119, https://openalex.org/I56590836 |
| authorships[3].institutions[0].country_code | AU |
| authorships[3].institutions[0].display_name | Australian Regenerative Medicine Institute |
| authorships[3].institutions[1].id | https://openalex.org/I56590836 |
| authorships[3].institutions[1].ror | https://ror.org/02bfwt286 |
| authorships[3].institutions[1].type | education |
| authorships[3].institutions[1].lineage | https://openalex.org/I56590836 |
| authorships[3].institutions[1].country_code | AU |
| authorships[3].institutions[1].display_name | Monash University |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Stuckey, Peter J |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | Monash University |
| authorships[4].author.id | https://openalex.org/A5035242315 |
| authorships[4].author.orcid | https://orcid.org/0000-0003-0842-9533 |
| authorships[4].author.display_name | Pierre Le Bodic |
| authorships[4].countries | AU |
| authorships[4].affiliations[0].institution_ids | https://openalex.org/I2801239119, https://openalex.org/I56590836 |
| authorships[4].affiliations[0].raw_affiliation_string | Monash University |
| authorships[4].institutions[0].id | https://openalex.org/I2801239119 |
| authorships[4].institutions[0].ror | https://ror.org/02qa5kg76 |
| authorships[4].institutions[0].type | facility |
| authorships[4].institutions[0].lineage | https://openalex.org/I2801037857, https://openalex.org/I2801239119, https://openalex.org/I56590836 |
| authorships[4].institutions[0].country_code | AU |
| authorships[4].institutions[0].display_name | Australian Regenerative Medicine Institute |
| authorships[4].institutions[1].id | https://openalex.org/I56590836 |
| authorships[4].institutions[1].ror | https://ror.org/02bfwt286 |
| authorships[4].institutions[1].type | education |
| authorships[4].institutions[1].lineage | https://openalex.org/I56590836 |
| authorships[4].institutions[1].country_code | AU |
| authorships[4].institutions[1].display_name | Monash University |
| authorships[4].author_position | last |
| authorships[4].raw_author_name | Bodic, Pierre Le |
| authorships[4].is_corresponding | False |
| authorships[4].raw_affiliation_strings | Monash University |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2207.02436 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Multi-Target Search in Euclidean Space with Ray Shooting (Full Version) |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10586 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.991599977016449 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1707 |
| primary_topic.subfield.display_name | Computer Vision and Pattern Recognition |
| primary_topic.display_name | Robotic Path Planning Algorithms |
| related_works | https://openalex.org/W2090152127, https://openalex.org/W1965169884, https://openalex.org/W3125580510, https://openalex.org/W2008939113, https://openalex.org/W14679004, https://openalex.org/W1566651525, https://openalex.org/W2977652649, https://openalex.org/W2318206461, https://openalex.org/W37157938, https://openalex.org/W4298154183 |
| cited_by_count | 3 |
| counts_by_year[0].year | 2023 |
| counts_by_year[0].cited_by_count | 2 |
| counts_by_year[1].year | 2021 |
| counts_by_year[1].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2207.02436 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2207.02436 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2207.02436 |
| primary_location.id | pmh:oai:arXiv.org:2207.02436 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/2207.02436 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2207.02436 |
| publication_date | 2022-07-06 |
| publication_year | 2022 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 7, 16 |
| abstract_inverted_index.In | 35 |
| abstract_inverted_index.We | 51, 88 |
| abstract_inverted_index.be | 58 |
| abstract_inverted_index.by | 45 |
| abstract_inverted_index.in | 60, 83 |
| abstract_inverted_index.is | 6, 69, 103 |
| abstract_inverted_index.it | 102 |
| abstract_inverted_index.of | 75 |
| abstract_inverted_index.on | 29 |
| abstract_inverted_index.to | 21, 71 |
| abstract_inverted_index.we | 38, 41 |
| abstract_inverted_index.The | 0 |
| abstract_inverted_index.and | 32 |
| abstract_inverted_index.can | 42 |
| abstract_inverted_index.has | 25 |
| abstract_inverted_index.how | 40, 55 |
| abstract_inverted_index.new | 17 |
| abstract_inverted_index.ray | 30 |
| abstract_inverted_index.the | 61, 73, 84, 90, 94, 99 |
| abstract_inverted_index.ESPP | 96 |
| abstract_inverted_index.This | 79 |
| abstract_inverted_index.also | 52, 81 |
| abstract_inverted_index.been | 26 |
| abstract_inverted_index.into | 54 |
| abstract_inverted_index.look | 53 |
| abstract_inverted_index.many | 12 |
| abstract_inverted_index.path | 3 |
| abstract_inverted_index.rays | 76 |
| abstract_inverted_index.show | 39 |
| abstract_inverted_index.this | 22, 36 |
| abstract_inverted_index.used | 70 |
| abstract_inverted_index.well | 8 |
| abstract_inverted_index.with | 11 |
| abstract_inverted_index.about | 48 |
| abstract_inverted_index.based | 28 |
| abstract_inverted_index.case. | 87 |
| abstract_inverted_index.could | 57 |
| abstract_inverted_index.helps | 82 |
| abstract_inverted_index.logic | 66 |
| abstract_inverted_index.paper | 37 |
| abstract_inverted_index.shots | 77 |
| abstract_inverted_index.where | 65, 101 |
| abstract_inverted_index.(ESPP) | 5 |
| abstract_inverted_index.during | 67 |
| abstract_inverted_index.number | 74 |
| abstract_inverted_index.online | 19 |
| abstract_inverted_index.reduce | 72 |
| abstract_inverted_index.scans. | 50 |
| abstract_inverted_index.single | 85 |
| abstract_inverted_index.target | 86 |
| abstract_inverted_index.RayScan | 44, 56 |
| abstract_inverted_index.against | 93 |
| abstract_inverted_index.applied | 59 |
| abstract_inverted_index.better. | 104 |
| abstract_inverted_index.compare | 89 |
| abstract_inverted_index.improve | 43 |
| abstract_inverted_index.polygon | 33, 49 |
| abstract_inverted_index.problem | 4, 10 |
| abstract_inverted_index.studied | 9 |
| abstract_inverted_index.RayScan+ | 92 |
| abstract_inverted_index.RayScan, | 24 |
| abstract_inverted_index.Recently | 15 |
| abstract_inverted_index.approach | 20 |
| abstract_inverted_index.improved | 91 |
| abstract_inverted_index.problem, | 23 |
| abstract_inverted_index.scanning | 68 |
| abstract_inverted_index.shooting | 31 |
| abstract_inverted_index.shortest | 2 |
| abstract_inverted_index.Euclidean | 1 |
| abstract_inverted_index.carefully | 46 |
| abstract_inverted_index.efficient | 18 |
| abstract_inverted_index.practical | 13 |
| abstract_inverted_index.reasoning | 47 |
| abstract_inverted_index.required. | 78 |
| abstract_inverted_index.scanning. | 34 |
| abstract_inverted_index.scenario, | 64 |
| abstract_inverted_index.algorithm, | 97 |
| abstract_inverted_index.developed, | 27 |
| abstract_inverted_index.situations | 100 |
| abstract_inverted_index.improvement | 80 |
| abstract_inverted_index.illustrating | 98 |
| abstract_inverted_index.multi-target | 63 |
| abstract_inverted_index.applications. | 14 |
| abstract_inverted_index.single-source | 62 |
| abstract_inverted_index.state-of-the-art | 95 |
| cited_by_percentile_year | |
| countries_distinct_count | 1 |
| institutions_distinct_count | 5 |
| citation_normalized_percentile |