Executing convex polytope queries on nD point clouds
•Efficient intersection algorithms for polytope querying on nD point clouds.•Easy-to-use polytope formulation for querying.•Illustrated by nD-simplex and nD-prism model for querying tests from 2D to 10D.•Solve perspective view selection and flood risk query efficiently using the polytope. Efficient...
Gespeichert in:
| Veröffentlicht in: | International journal of applied earth observation and geoinformation Jg. 105; S. 102625 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
25.12.2021
Elsevier |
| Schlagworte: | |
| ISSN: | 1569-8432, 1872-826X |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | •Efficient intersection algorithms for polytope querying on nD point clouds.•Easy-to-use polytope formulation for querying.•Illustrated by nD-simplex and nD-prism model for querying tests from 2D to 10D.•Solve perspective view selection and flood risk query efficiently using the polytope.
Efficient spatial queries are frequently needed to extract useful information from massive nD point clouds. Most previous studies focus on developing solutions for orthogonal window queries, while rarely considering the polytope query. The latter query, which includes the widely adopted polygonal query in 2D, also plays a critical role in many nD spatial applications such as the perspective view selection. Aiming for an nD solution, this paper first formulates a convex nD-polytope for querying. Then, the paper integrates three approximate geometric algorithms – SWEEP, SPHERE, VERTEX, and a linear programming method CPLEX, developing a solution based on an Index-Organized Table (IOT) approach. IOT is applied with space filling curve based clustering and advanced querying mechanism which recursively refines hypercubic nD spaces to approach the query geometry for primary filtering. Results from experiments based on both synthetic and real data have confirmed the superior performance of SWEEP. However, the algorithm may lag behind CPLEX due to pessimistic intersection computation in high dimensional spaces. In a real application, by properly transforming a perspective view selection into a polytope query, the solution achieves a sub-second querying performance using SWEEP. In another flood risk query, SWEEP also leads the others. In general, the robust and efficient solution can be immediately used to address different polytope queries, including those abstract ones whose constraints on combinations of different dimensions are formed into a polytope model. Besides, the knowledge of high-dimensional computations acquired also provides significant guidance for handling more nD GIS issues. |
|---|---|
| AbstractList | Efficient spatial queries are frequently needed to extract useful information from massive nD point clouds. Most previous studies focus on developing solutions for orthogonal window queries, while rarely considering the polytope query. The latter query, which includes the widely adopted polygonal query in 2D, also plays a critical role in many nD spatial applications such as the perspective view selection. Aiming for an nD solution, this paper first formulates a convex nD-polytope for querying. Then, the paper integrates three approximate geometric algorithms – SWEEP, SPHERE, VERTEX, and a linear programming method CPLEX, developing a solution based on an Index-Organized Table (IOT) approach. IOT is applied with space filling curve based clustering and advanced querying mechanism which recursively refines hypercubic nD spaces to approach the query geometry for primary filtering. Results from experiments based on both synthetic and real data have confirmed the superior performance of SWEEP. However, the algorithm may lag behind CPLEX due to pessimistic intersection computation in high dimensional spaces. In a real application, by properly transforming a perspective view selection into a polytope query, the solution achieves a sub-second querying performance using SWEEP. In another flood risk query, SWEEP also leads the others. In general, the robust and efficient solution can be immediately used to address different polytope queries, including those abstract ones whose constraints on combinations of different dimensions are formed into a polytope model. Besides, the knowledge of high-dimensional computations acquired also provides significant guidance for handling more nD GIS issues. •Efficient intersection algorithms for polytope querying on nD point clouds.•Easy-to-use polytope formulation for querying.•Illustrated by nD-simplex and nD-prism model for querying tests from 2D to 10D.•Solve perspective view selection and flood risk query efficiently using the polytope. Efficient spatial queries are frequently needed to extract useful information from massive nD point clouds. Most previous studies focus on developing solutions for orthogonal window queries, while rarely considering the polytope query. The latter query, which includes the widely adopted polygonal query in 2D, also plays a critical role in many nD spatial applications such as the perspective view selection. Aiming for an nD solution, this paper first formulates a convex nD-polytope for querying. Then, the paper integrates three approximate geometric algorithms – SWEEP, SPHERE, VERTEX, and a linear programming method CPLEX, developing a solution based on an Index-Organized Table (IOT) approach. IOT is applied with space filling curve based clustering and advanced querying mechanism which recursively refines hypercubic nD spaces to approach the query geometry for primary filtering. Results from experiments based on both synthetic and real data have confirmed the superior performance of SWEEP. However, the algorithm may lag behind CPLEX due to pessimistic intersection computation in high dimensional spaces. In a real application, by properly transforming a perspective view selection into a polytope query, the solution achieves a sub-second querying performance using SWEEP. In another flood risk query, SWEEP also leads the others. In general, the robust and efficient solution can be immediately used to address different polytope queries, including those abstract ones whose constraints on combinations of different dimensions are formed into a polytope model. Besides, the knowledge of high-dimensional computations acquired also provides significant guidance for handling more nD GIS issues. |
| ArticleNumber | 102625 |
| Author | Liu, Haicheng van Oosterom, Peter Meijers, Martijn Thompson, Rodney |
| Author_xml | – sequence: 1 givenname: Haicheng surname: Liu fullname: Liu, Haicheng email: h.liu-6@tudelft.nl – sequence: 2 givenname: Rodney surname: Thompson fullname: Thompson, Rodney – sequence: 3 givenname: Peter surname: van Oosterom fullname: van Oosterom, Peter – sequence: 4 givenname: Martijn surname: Meijers fullname: Meijers, Martijn |
| BookMark | eNp9kDtPBCEUhYnRxOcPsJvSZlbeMLEyPjcxsbGwIyzc2TAZYYVZo_9e1jGWVsAJ55x7v2O0H1MEhM4JXhBM5OWwGOx6QTEl9U0lFXvoiGhFW03l6369C9m1mjN6iI5LGTAmSkl9hPjdJ7jtFOK6cSl-wGezSePXlDbQvG8hByhNik28rXKIU-PGtPXlFB30dixw9nueoJf7u5ebx_bp-WF5c_3UOtaRqfXMg-CKrzzDhEvLO6x45xwB1vdiJbFTnZNihYVeMUksZr3wjmIJVgkq2AlazrE-2cFscniz-cskG8yPkPLa2DwFN4LhigDtvcCaCq451cQLwcED1o7Uxpp1MWdtcqqLlcm8heJgHG2EtC2GSiWEZpztasn81eVUSob-r5pgs4NtBlNhmx1sM8OunqvZAxXHR4BsigsQHfiQwU114PCP-xtgo4bn |
| Cites_doi | 10.54419/fxkgf8 10.1007/s007780050030 10.1145/197405.197408 10.1006/jcss.2000.1709 10.1111/j.1752-1688.2008.00217.x 10.1016/j.cag.2015.01.007 10.5121/ijdms.2020.12302 10.1090/S0894-0347-1989-1001852-0 10.1016/0925-7721(92)90006-E |
| ContentType | Journal Article |
| Copyright | 2021 The Author(s) |
| Copyright_xml | – notice: 2021 The Author(s) |
| DBID | 6I. AAFTH AAYXX CITATION 7S9 L.6 DOA |
| DOI | 10.1016/j.jag.2021.102625 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef AGRICOLA AGRICOLA - Academic DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef AGRICOLA AGRICOLA - Academic |
| DatabaseTitleList | AGRICOLA |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Environmental Sciences |
| EISSN | 1872-826X |
| ExternalDocumentID | oai_doaj_org_article_471e2fd50825484281d554ede08c1cc1 10_1016_j_jag_2021_102625 S0303243421003329 |
| GroupedDBID | 4.4 5GY 6I. AAFTH AAXUO ABFYP ABLST ABQEM ABQYD ABYKQ ACLVX ACRLP ACSBN ADBBV AFKWA AFTJW AFXIZ AGYEJ AHEUO AIKHN AJOXV AKIFW ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ATOGT BKOJK BLECG EBS FDB FEDTE FIRID FYGXN GROUPED_DOAJ HVGLF IMUCA KCYFY KOM M41 O-L P-8 P-9 P2P ROL SDF SDG SES SPC SSE SSJ T5K ~02 29J AAHBH AALRI AAQXK AATTM AAXKI AAYWO AAYXX ABJNI ABWVN ACLOT ACRPL ADMUD ADNMO ADVLN AEIPS AFJKZ AGQPQ AIIUN AITUG ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFJIC EFKBS EJD R2- 7S9 L.6 |
| ID | FETCH-LOGICAL-c391t-d3de5474bd30146a490749cc1e3ff5b60c79c65b058b361a03f5dc206ea75253 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000734884400003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1569-8432 |
| IngestDate | Fri Oct 03 12:53:20 EDT 2025 Sun Sep 28 01:15:04 EDT 2025 Sat Nov 29 07:20:22 EST 2025 Fri Feb 23 02:39:57 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | nD point clouds Spatial data structures Perspective view selection Polytope query CPLEX |
| Language | English |
| License | This is an open access article under the CC BY license. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c391t-d3de5474bd30146a490749cc1e3ff5b60c79c65b058b361a03f5dc206ea75253 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| OpenAccessLink | https://doaj.org/article/471e2fd50825484281d554ede08c1cc1 |
| PQID | 2675583435 |
| PQPubID | 24069 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_471e2fd50825484281d554ede08c1cc1 proquest_miscellaneous_2675583435 crossref_primary_10_1016_j_jag_2021_102625 elsevier_sciencedirect_doi_10_1016_j_jag_2021_102625 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-12-25 |
| PublicationDateYYYYMMDD | 2021-12-25 |
| PublicationDate_xml | – month: 12 year: 2021 text: 2021-12-25 day: 25 |
| PublicationDecade | 2020 |
| PublicationTitle | International journal of applied earth observation and geoinformation |
| PublicationYear | 2021 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | Matoušek (b0070) 1992; 2 van Oosterom, Martinez-Rubi, Ivanova, Horhammer, Geringer, Ravada, Tijssen, Kodde, Gonçalves (b0085) 2015; 49 Khan, Yanki, Dimcheva, Kossmann (b0040) 2014 Liu, H., Thompson, R., van Oosterom, P., Meijers, M., 2021b. Fundamentals, implementations and experimental benchmarks of nD-polytype queries on point cloud data sets. Tech. rep. Delft University of Technology. PDAL-Contributors, 2018. PDAL Point Data Abstraction Library. Matoušek (b0075) 1994; 26 Kollios, Gunopulos, Tsotras (b0045) 1999 Evangelidis, Lomet, Salzberg (b0020) 1997; 6 Schütz, Krösl, Wimmer (b0095) 2019 AHN, 2014. Actueel Hoogtebestand Nederland. van Oosterom, P., 2019. From discrete to continuous levels of detail for managing nD-PointClouds. In: ISPRS Geospatial Week 2019. Enschede, the Netherlands. Goldstein, Ramakrishnan, Shaft, Yu (b0030) 1997 Wang, Ravishankar (b0105) 2013 Gharbi, Soualmia, Dartus, Masbernat (b0025) 2016; 7 Liu, Oosterom, Mao, Meijers, Thompson (b0055) 2021; vol. XLIII-B4-2021 Lima, R., 2010. IBM ILOG CPLEX - what is inside of the box? In: EWO Seminar. Carnegie Mellon University, Pittsburgh, PA, USA. Liu, van Oosterom, Meijers, Guan, Verbree, Horhammer (b0065) 2020; 12 (accessed: 2021-10-19). Chazelle (b0015) 1989; 2 Agarwal, Arge, Erickson, Franciosa, Vitter (b0005) 2000; 61 Jonkman, Penning-Rowsell (b0035) 2008; 44 Thompson, R., 2007. Towards a Rigorous Logic for Spatial Data Representation. Ph.D. thesis, Delft University of Technology. Published as NCG Publications on Geodesy no. 65. Gharbi (10.1016/j.jag.2021.102625_b0025) 2016; 7 Liu (10.1016/j.jag.2021.102625_b0065) 2020; 12 10.1016/j.jag.2021.102625_b0080 Goldstein (10.1016/j.jag.2021.102625_b0030) 1997 10.1016/j.jag.2021.102625_b0050 10.1016/j.jag.2021.102625_b0060 Chazelle (10.1016/j.jag.2021.102625_b0015) 1989; 2 van Oosterom (10.1016/j.jag.2021.102625_b0085) 2015; 49 Evangelidis (10.1016/j.jag.2021.102625_b0020) 1997; 6 Jonkman (10.1016/j.jag.2021.102625_b0035) 2008; 44 10.1016/j.jag.2021.102625_b0090 10.1016/j.jag.2021.102625_b0100 Kollios (10.1016/j.jag.2021.102625_b0045) 1999 10.1016/j.jag.2021.102625_b0010 Wang (10.1016/j.jag.2021.102625_b0105) 2013 Schütz (10.1016/j.jag.2021.102625_b0095) 2019 Matoušek (10.1016/j.jag.2021.102625_b0070) 1992; 2 Liu (10.1016/j.jag.2021.102625_b0055) 2021; vol. XLIII-B4-2021 Matoušek (10.1016/j.jag.2021.102625_b0075) 1994; 26 Khan (10.1016/j.jag.2021.102625_b0040) 2014 Agarwal (10.1016/j.jag.2021.102625_b0005) 2000; 61 |
| References_xml | – reference: AHN, 2014. Actueel Hoogtebestand Nederland. – volume: 6 start-page: 1 year: 1997 end-page: 25 ident: b0020 article-title: The hB publication-title: VLDB J. – reference: PDAL-Contributors, 2018. PDAL Point Data Abstraction Library. – volume: 12 start-page: 7 year: 2020 end-page: 28 ident: b0065 article-title: HistSFC: Optimization for nD massive spatial points querying publication-title: Int. J. Database Manage. Syst. (IJDMS) – volume: 61 start-page: 194 year: 2000 end-page: 216 ident: b0005 article-title: Efficient searching with linear constraints publication-title: J. Comput. Syst. Sci. – start-page: 314 year: 2013 end-page: 325 ident: b0105 article-title: Secure and efficient range queries on outsourced databases using Rp-trees publication-title: 2013 IEEE 29th International Conference on Data Engineering (ICDE) – start-page: 261 year: 1999 end-page: 272 ident: b0045 article-title: On indexing mobile objects publication-title: Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems – start-page: 241 year: 2014 end-page: 252 ident: b0040 article-title: Towards indexing functions: Answering scalar product queries publication-title: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data – reference: Liu, H., Thompson, R., van Oosterom, P., Meijers, M., 2021b. Fundamentals, implementations and experimental benchmarks of nD-polytype queries on point cloud data sets. Tech. rep. Delft University of Technology. – volume: vol. XLIII-B4-2021 start-page: 367 year: 2021 end-page: 374 ident: b0055 article-title: An efficient nD-point data structure for querying flood risks publication-title: The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences – reference: van Oosterom, P., 2019. From discrete to continuous levels of detail for managing nD-PointClouds. In: ISPRS Geospatial Week 2019. Enschede, the Netherlands. – reference: (accessed: 2021-10-19). – reference: Thompson, R., 2007. Towards a Rigorous Logic for Spatial Data Representation. Ph.D. thesis, Delft University of Technology. Published as NCG Publications on Geodesy no. 65. – start-page: 257 year: 1997 end-page: 267 ident: b0030 article-title: Processing queries by linear constraints publication-title: Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems – volume: 44 start-page: 1208 year: 2008 end-page: 1218 ident: b0035 article-title: Human instability in flood flows publication-title: J. Am. Water Resour. Assoc. – volume: 49 start-page: 92 year: 2015 end-page: 125 ident: b0085 article-title: Massive point cloud data management: Design, implementation and execution of a point cloud benchmark publication-title: Comput. Graph. – volume: 2 start-page: 637 year: 1989 end-page: 666 ident: b0015 article-title: Lower bounds on the complexity of polytope range searching publication-title: J. Am. Math. Soc. – volume: 2 start-page: 169 year: 1992 end-page: 186 ident: b0070 article-title: Reporting points in halfspaces publication-title: Comput. Geom. – volume: 26 start-page: 422 year: 1994 end-page: 461 ident: b0075 article-title: Geometric range searching publication-title: ACM Comput. Surv. (CSUR) – start-page: 103 year: 2019 end-page: 110 ident: b0095 article-title: Real-time continuous level of detail rendering of point clouds publication-title: 2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR) – reference: Lima, R., 2010. IBM ILOG CPLEX - what is inside of the box? In: EWO Seminar. Carnegie Mellon University, Pittsburgh, PA, USA. – volume: 7 start-page: 3017 year: 2016 end-page: 3026 ident: b0025 article-title: Comparison of 1D and 2D hydraulic models for floods simulation on the Medjerda Riverin Tunisia publication-title: J. Mater. Environ. Sci. – volume: vol. XLIII-B4-2021 start-page: 367 year: 2021 ident: 10.1016/j.jag.2021.102625_b0055 article-title: An efficient nD-point data structure for querying flood risks – ident: 10.1016/j.jag.2021.102625_b0050 – ident: 10.1016/j.jag.2021.102625_b0100 doi: 10.54419/fxkgf8 – start-page: 314 year: 2013 ident: 10.1016/j.jag.2021.102625_b0105 article-title: Secure and efficient range queries on outsourced databases using Rp-trees – start-page: 257 year: 1997 ident: 10.1016/j.jag.2021.102625_b0030 article-title: Processing queries by linear constraints – ident: 10.1016/j.jag.2021.102625_b0080 – volume: 6 start-page: 1 year: 1997 ident: 10.1016/j.jag.2021.102625_b0020 article-title: The hBΠ-tree: a multi-attribute index supporting concurrency, recovery and node consolidation publication-title: VLDB J. doi: 10.1007/s007780050030 – volume: 7 start-page: 3017 year: 2016 ident: 10.1016/j.jag.2021.102625_b0025 article-title: Comparison of 1D and 2D hydraulic models for floods simulation on the Medjerda Riverin Tunisia publication-title: J. Mater. Environ. Sci. – volume: 26 start-page: 422 year: 1994 ident: 10.1016/j.jag.2021.102625_b0075 article-title: Geometric range searching publication-title: ACM Comput. Surv. (CSUR) doi: 10.1145/197405.197408 – start-page: 261 year: 1999 ident: 10.1016/j.jag.2021.102625_b0045 article-title: On indexing mobile objects – ident: 10.1016/j.jag.2021.102625_b0060 – start-page: 103 year: 2019 ident: 10.1016/j.jag.2021.102625_b0095 article-title: Real-time continuous level of detail rendering of point clouds – volume: 61 start-page: 194 year: 2000 ident: 10.1016/j.jag.2021.102625_b0005 article-title: Efficient searching with linear constraints publication-title: J. Comput. Syst. Sci. doi: 10.1006/jcss.2000.1709 – volume: 44 start-page: 1208 year: 2008 ident: 10.1016/j.jag.2021.102625_b0035 article-title: Human instability in flood flows publication-title: J. Am. Water Resour. Assoc. doi: 10.1111/j.1752-1688.2008.00217.x – volume: 49 start-page: 92 year: 2015 ident: 10.1016/j.jag.2021.102625_b0085 article-title: Massive point cloud data management: Design, implementation and execution of a point cloud benchmark publication-title: Comput. Graph. doi: 10.1016/j.cag.2015.01.007 – ident: 10.1016/j.jag.2021.102625_b0090 – start-page: 241 year: 2014 ident: 10.1016/j.jag.2021.102625_b0040 article-title: Towards indexing functions: Answering scalar product queries – volume: 12 start-page: 7 year: 2020 ident: 10.1016/j.jag.2021.102625_b0065 article-title: HistSFC: Optimization for nD massive spatial points querying publication-title: Int. J. Database Manage. Syst. (IJDMS) doi: 10.5121/ijdms.2020.12302 – volume: 2 start-page: 637 year: 1989 ident: 10.1016/j.jag.2021.102625_b0015 article-title: Lower bounds on the complexity of polytope range searching publication-title: J. Am. Math. Soc. doi: 10.1090/S0894-0347-1989-1001852-0 – ident: 10.1016/j.jag.2021.102625_b0010 – volume: 2 start-page: 169 year: 1992 ident: 10.1016/j.jag.2021.102625_b0070 article-title: Reporting points in halfspaces publication-title: Comput. Geom. doi: 10.1016/0925-7721(92)90006-E |
| SSID | ssj0017768 |
| Score | 2.322654 |
| Snippet | •Efficient intersection algorithms for polytope querying on nD point clouds.•Easy-to-use polytope formulation for querying.•Illustrated by nD-simplex and... Efficient spatial queries are frequently needed to extract useful information from massive nD point clouds. Most previous studies focus on developing solutions... |
| SourceID | doaj proquest crossref elsevier |
| SourceType | Open Website Aggregation Database Index Database Publisher |
| StartPage | 102625 |
| SubjectTerms | algorithms CPLEX geometry nD point clouds Perspective view selection Polytope query risk spatial data Spatial data structures |
| Title | Executing convex polytope queries on nD point clouds |
| URI | https://dx.doi.org/10.1016/j.jag.2021.102625 https://www.proquest.com/docview/2675583435 https://doaj.org/article/471e2fd50825484281d554ede08c1cc1 |
| Volume | 105 |
| WOSCitedRecordID | wos000734884400003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1872-826X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017768 issn: 1569-8432 databaseCode: DOA dateStart: 20200101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT9wwELbQqgc4VBSKuoVWQeKEFNXxO0egizitOOyBm-VXqkUoWW2Siv77jp0Etj2US6-WFVvf2DPzZcYzCF0YMBrYWQY3TfKcVcTkylsef-IIb13w2KnUbEIul-rhobzfafUVc8KG8sADcN9AeQZSeZ6ojAJnufBgAYMPWLnCuUR8sCwnMjXGD6QcHsFxUeaKUTLFM1Nm16P5AcSQFLFsgYg9sncsUirc_4dh-ktFJ7tze4jejw5jdjVs9APaC_UROtgpI3iEThavr9Vg6nhd22PEFs_B9TGxOUvZ5c_Zpnn61TWbkMFakSRnTZ3V32F4XXeZe2p6335Eq9vF6uYuH9sk5I6WRZd76gNnklkf6ZEwLPLdEqAJtKq4FdjJ0gluMVeWisJgWnHvCBbBSE44PUGzuqnDJ5SVpqSWWuVosMxRbK2woAsl4UZxIG5zdDkhpTdDMQw9ZYk9aoBVR1j1AOscXUcsXybGOtZpAKSrR-nqt6Q7R2yShB5dgsHUw6fW_1r7fJKahusSYyCmDk3fagIEiSsKTuLn_7G_U7Qfl435LYSfoVm37cMX9M797Nbt9ms6k78B4IniCw |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Executing+convex+polytope+queries+on+nD+point+clouds&rft.jtitle=International+journal+of+applied+earth+observation+and+geoinformation&rft.au=Liu%2C+Haicheng&rft.au=Thompson%2C+Rodney&rft.au=van+Oosterom%2C+Peter&rft.au=Meijers%2C+Martijn&rft.date=2021-12-25&rft.issn=1569-8432&rft.volume=105+p.102625-&rft_id=info:doi/10.1016%2Fj.jag.2021.102625&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1569-8432&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1569-8432&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1569-8432&client=summon |