Line-segment intersection made in-place
We present a space-efficient algorithm for reporting all k intersections induced by a set of n line segments in the plane. Our algorithm is an in-place variant of Balaban's algorithm and, in the worst case, runs in O ( n log 2 n + k ) time using O ( 1 ) extra words of memory in addition to the...
Uloženo v:
| Vydáno v: | Computational geometry : theory and applications Ročník 38; číslo 3; s. 213 - 230 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.10.2007
|
| Témata: | |
| ISSN: | 0925-7721 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We present a space-efficient algorithm for reporting all
k intersections induced by a set of
n line segments in the plane. Our algorithm is an in-place variant of Balaban's algorithm and, in the worst case, runs in
O
(
n
log
2
n
+
k
)
time using
O
(
1
)
extra words of memory in addition to the space used for the input to the algorithm. |
|---|---|
| AbstractList | We present a space-efficient algorithm for reporting all
k intersections induced by a set of
n line segments in the plane. Our algorithm is an in-place variant of Balaban's algorithm and, in the worst case, runs in
O
(
n
log
2
n
+
k
)
time using
O
(
1
)
extra words of memory in addition to the space used for the input to the algorithm. |
| Author | Vahrenhold, Jan |
| Author_xml | – sequence: 1 givenname: Jan surname: Vahrenhold fullname: Vahrenhold, Jan email: jan.vahrenhold@cs.uni-dortmund.de organization: Universität Dortmund, Informatik XI, 44221 Dortmund, Germany |
| BookMark | eNqFkE1LAzEURbOoYFv9By66czXjSyaZaVwIUvyCATe6DvHlpaR0MiUJgv_eKXXlQlcPLpzLPW_BZnGMxNgVh5oDb292NY7DlsZaALQ16BqAz9gctFBV1wl-zhY57wBACKXn7LoPkapM24FiWYVYKGXCEsa4GqyjKakOe4t0wc683We6_LlL9v748LZ5rvrXp5fNfV9hA22pJGnBufpYg7BSWM-lQt36jgA6v27QK47W-XbtuOxQSI2d99yBUqCdFK5ZsttTL6Yx50TeYCj2uKckG_aGgzlqmp05aZqjpgFtJs0Jlr_gQwqDTV__YXcnjCaxz0DJZAwUkVxI0y-MG8PfBd9U_3Hh |
| CitedBy_id | crossref_primary_10_1016_j_comgeo_2010_04_005 crossref_primary_10_1007_s10878_012_9452_4 crossref_primary_10_1016_j_comgeo_2012_09_007 crossref_primary_10_1007_s10878_021_00731_3 crossref_primary_10_1007_s00453_008_9193_z crossref_primary_10_3390_s21041260 |
| Cites_doi | 10.1201/9781420035315.ch38 10.1016/j.ipl.2005.11.018 10.1109/TC.1979.1675432 10.1016/S0925-7721(99)00057-7 10.1016/S0925-7721(01)00026-8 10.1007/BF01840440 10.1016/0022-0000(86)90043-7 10.1016/S0304-3975(98)00162-5 10.1016/j.comgeo.2006.03.006 10.1145/800057.808674 10.1007/BF01994842 10.1016/0020-0190(87)90202-X 10.1145/512274.512284 10.1016/j.tcs.2003.05.004 10.1007/BF01178508 10.1016/S0304-3975(02)00775-2 10.1145/147508.147511 10.1145/355588.365103 10.1137/0206025 |
| ContentType | Journal Article |
| Copyright | 2006 Elsevier B.V. |
| Copyright_xml | – notice: 2006 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.comgeo.2006.09.001 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EndPage | 230 |
| ExternalDocumentID | 10_1016_j_comgeo_2006_09_001 S0925772106000885 |
| GroupedDBID | --K --M -DZ .DC .~1 0R~ 1B1 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6I. 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABAOU ABBOA ABFNM ABMAC ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADMUD AEBSH AEKER AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSV SSW SSZ T5K UHS WUQ XPP ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABJNI ABWVN ACLOT ACRPL ADNMO ADVLN AEIPS AFJKZ AGQPQ AIIUN ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c306t-4e92115b802a42af145c96f7e007f83cf51cadf68d147c249c7ff1d05509d42d3 |
| ISICitedReferencesCount | 10 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000249488900007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0925-7721 |
| IngestDate | Sat Nov 29 03:12:50 EST 2025 Tue Nov 18 21:58:30 EST 2025 Fri Feb 23 02:17:40 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Line-segment intersection Space-efficient algorithms In-place algorithms |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c306t-4e92115b802a42af145c96f7e007f83cf51cadf68d147c249c7ff1d05509d42d3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.comgeo.2006.09.001 |
| PageCount | 18 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_comgeo_2006_09_001 crossref_primary_10_1016_j_comgeo_2006_09_001 elsevier_sciencedirect_doi_10_1016_j_comgeo_2006_09_001 |
| PublicationCentury | 2000 |
| PublicationDate | 2007-10-01 |
| PublicationDateYYYYMMDD | 2007-10-01 |
| PublicationDate_xml | – month: 10 year: 2007 text: 2007-10-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | Computational geometry : theory and applications |
| PublicationYear | 2007 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | S. Schirra, Robustness and precision issues in geometric computation, in Brönnimann, Chan, Chen (bib006) 2004 E.Y. Chen, T.M.-Y. Chan, A space-efficient algorithm for line segment intersection, in: Proceedings of the 15th Canadian Conference on Computational Geometry, 2003, pp. 68–71 Chen (bib013) April 2006; 98 Williams (bib027) June 1964; 7 Geffert, Katajainen, Pasanen (bib015) April 2000; 237 (bib016) 2004 Chazelle, Guibas (bib010) 1986; 1 Chapter 38, pp. 857–876 Kleinberg, Tardos (bib019) 2006 Chazelle, Edelsbrunner (bib009) January 1992; 39 Vahrenhold (bib026) 2005; vol. 3608 Munro (bib021) August 1986; 33 P. Bose, A. Maheshwari, P. Morin, J. Morrison, M. Smid, J. Vahrenhold, Space-efficient geometric divide-and-conquer algorithms, Computational Geometry: Theory & Applications (2006) Brönnimann, Iacono, Katajainen, Morin, Morrison, Toussaint (bib007) June 2004; 321 D.M. Mount, Geometric intersection, in Chen (bib012) June 2003; 302 Boissonnat, Snoeyink (bib003) May 2000; 16 Salowe, Steiger (bib024) July 1987; 25 Pardo (bib022) June 1977; 6 (bib023) 2000 Katajainen, Pasanen (bib017) 1992; 32 in press, accepted November 2004. An extended abstract appeared in: Proceedings of the 20th European Workshop on Computational Geometry, 2004, pp. 65–68 Katajainen, Pasanen (bib018) 1994; 31 Floyd (bib014) December 1964; 7 Bentley, Ottmann (bib002) 1979; C-28 Balaban (bib001) 1995 Boissonnat, Vigneron (bib004) March 2002; 21 B. Chazelle, Intersecting is easier than sorting, in: Proceedings of the 16th Annual ACM Symposium on Theory of Computing, 1984, pp. 125–134 Chapter 14, pp. 597–632 (10.1016/j.comgeo.2006.09.001_bib023) 2000 Salowe (10.1016/j.comgeo.2006.09.001_bib024) 1987; 25 Balaban (10.1016/j.comgeo.2006.09.001_bib001) 1995 Munro (10.1016/j.comgeo.2006.09.001_bib021) 1986; 33 Boissonnat (10.1016/j.comgeo.2006.09.001_bib004) 2002; 21 Brönnimann (10.1016/j.comgeo.2006.09.001_bib006) 2004 Chazelle (10.1016/j.comgeo.2006.09.001_bib010) 1986; 1 Williams (10.1016/j.comgeo.2006.09.001_bib027) 1964; 7 10.1016/j.comgeo.2006.09.001_bib025 10.1016/j.comgeo.2006.09.001_bib020 10.1016/j.comgeo.2006.09.001_bib008 Chazelle (10.1016/j.comgeo.2006.09.001_bib009) 1992; 39 Brönnimann (10.1016/j.comgeo.2006.09.001_bib007) 2004; 321 Chen (10.1016/j.comgeo.2006.09.001_bib013) 2006; 98 Kleinberg (10.1016/j.comgeo.2006.09.001_bib019) 2006 10.1016/j.comgeo.2006.09.001_bib005 Katajainen (10.1016/j.comgeo.2006.09.001_bib017) 1992; 32 Chen (10.1016/j.comgeo.2006.09.001_bib012) 2003; 302 Pardo (10.1016/j.comgeo.2006.09.001_bib022) 1977; 6 (10.1016/j.comgeo.2006.09.001_bib016) 2004 Floyd (10.1016/j.comgeo.2006.09.001_bib014) 1964; 7 Boissonnat (10.1016/j.comgeo.2006.09.001_bib003) 2000; 16 Geffert (10.1016/j.comgeo.2006.09.001_bib015) 2000; 237 Bentley (10.1016/j.comgeo.2006.09.001_bib002) 1979; C-28 10.1016/j.comgeo.2006.09.001_bib011 Katajainen (10.1016/j.comgeo.2006.09.001_bib018) 1994; 31 Vahrenhold (10.1016/j.comgeo.2006.09.001_bib026) 2005; vol. 3608 |
| References_xml | – year: 2004 ident: bib016 publication-title: Handbook of Discrete and Computational Geometry – reference: D.M. Mount, Geometric intersection, in: – volume: 25 start-page: 285 year: July 1987 end-page: 294 ident: bib024 article-title: Stable unmerging in linear time and constant space publication-title: Information Processing Letters – reference: , Chapter 38, pp. 857–876 – volume: 6 start-page: 351 year: June 1977 end-page: 372 ident: bib022 article-title: Stable sorting and merging with optimal space and time bounds publication-title: SIAM Journal on Computing – volume: 32 start-page: 580 year: 1992 end-page: 585 ident: bib017 article-title: Stable minimum space partitioning in linear time publication-title: BIT: Computer Science – reference: P. Bose, A. Maheshwari, P. Morin, J. Morrison, M. Smid, J. Vahrenhold, Space-efficient geometric divide-and-conquer algorithms, Computational Geometry: Theory & Applications (2006), – volume: 98 start-page: 34 year: April 2006 end-page: 40 ident: bib013 article-title: A simple algorithm for in-place merging publication-title: Information Processing Letters – volume: 33 start-page: 66 year: August 1986 end-page: 74 ident: bib021 article-title: An implicit data structure supporting insertion, deletion, and search in publication-title: Journal of Computer and System Sciences – start-page: 211 year: 1995 end-page: 219 ident: bib001 article-title: An optimal algorithm for finding segments [ publication-title: Proceedings of the Eleventh Annual Symposium on Computational Geometry – year: 2006 ident: bib019 article-title: Algorithm Design – volume: 16 start-page: 35 year: May 2000 end-page: 52 ident: bib003 article-title: Efficient algorithms for line and curve segment intersection using restricted predicates publication-title: Computational Geometry: Theory and Applications – reference: B. Chazelle, Intersecting is easier than sorting, in: Proceedings of the 16th Annual ACM Symposium on Theory of Computing, 1984, pp. 125–134 – volume: 321 start-page: 25 year: June 2004 end-page: 40 ident: bib007 article-title: Space-efficient planar convex hull algorithms publication-title: Theoretical Computer Science – volume: 31 start-page: 301 year: 1994 end-page: 313 ident: bib018 article-title: Sorting multisets stably in minimum space publication-title: Acta Informatica – reference: , in press, accepted November 2004. An extended abstract appeared in: Proceedings of the 20th European Workshop on Computational Geometry, 2004, pp. 65–68 – volume: 21 start-page: 167 year: March 2002 end-page: 175 ident: bib004 article-title: An elementary algorithm for reporting intersections of red/blue curve segments publication-title: Computational Geometry: Theory Applications – year: 2000 ident: bib023 publication-title: Handbook of Computational Geometry – volume: 7 start-page: 347 year: June 1964 end-page: 348 ident: bib027 article-title: Algorithm 232: Heapsort publication-title: Communications of the ACM – volume: 7 start-page: 701 year: December 1964 ident: bib014 article-title: Algorithm 245: Treesort publication-title: Communications of the ACM – start-page: 239 year: 2004 end-page: 246 ident: bib006 article-title: Towards in-place geometric algorithms publication-title: Proceedings of the Twentieth Annual Symposium on Computational Geometry – volume: C-28 start-page: 643 year: 1979 end-page: 647 ident: bib002 article-title: Algorithms for reporting and counting geometric intersections publication-title: IEEE Transactions on Computers – volume: 1 start-page: 133 year: 1986 end-page: 162 ident: bib010 article-title: Fractional cascading: I. A data structuring technique publication-title: Algorithmica – volume: 302 start-page: 191 year: June 2003 end-page: 210 ident: bib012 article-title: Optimizing stable in-place merging publication-title: Theoretical Computer Science – reference: , Chapter 14, pp. 597–632 – volume: vol. 3608 start-page: 146 year: 2005 end-page: 157 ident: bib026 article-title: Line-segment intersection made in-place publication-title: Algorithms and Data Structures – reference: E.Y. Chen, T.M.-Y. Chan, A space-efficient algorithm for line segment intersection, in: Proceedings of the 15th Canadian Conference on Computational Geometry, 2003, pp. 68–71 – volume: 237 start-page: 159 year: April 2000 end-page: 181 ident: bib015 article-title: Asymptotically efficient in-place merging publication-title: Theoretical Computer Science – reference: S. Schirra, Robustness and precision issues in geometric computation, in: – volume: 39 start-page: 1 year: January 1992 end-page: 54 ident: bib009 article-title: An optimal algorithm for intersecting line segments in the plane publication-title: Journal of the ACM – ident: 10.1016/j.comgeo.2006.09.001_bib020 doi: 10.1201/9781420035315.ch38 – start-page: 239 year: 2004 ident: 10.1016/j.comgeo.2006.09.001_bib006 article-title: Towards in-place geometric algorithms – year: 2000 ident: 10.1016/j.comgeo.2006.09.001_bib023 – volume: 98 start-page: 34 issue: 1 year: 2006 ident: 10.1016/j.comgeo.2006.09.001_bib013 article-title: A simple algorithm for in-place merging publication-title: Information Processing Letters doi: 10.1016/j.ipl.2005.11.018 – ident: 10.1016/j.comgeo.2006.09.001_bib011 – year: 2006 ident: 10.1016/j.comgeo.2006.09.001_bib019 – volume: C-28 start-page: 643 issue: 9 year: 1979 ident: 10.1016/j.comgeo.2006.09.001_bib002 article-title: Algorithms for reporting and counting geometric intersections publication-title: IEEE Transactions on Computers doi: 10.1109/TC.1979.1675432 – volume: 16 start-page: 35 issue: 1 year: 2000 ident: 10.1016/j.comgeo.2006.09.001_bib003 article-title: Efficient algorithms for line and curve segment intersection using restricted predicates publication-title: Computational Geometry: Theory and Applications doi: 10.1016/S0925-7721(99)00057-7 – volume: 21 start-page: 167 issue: 3 year: 2002 ident: 10.1016/j.comgeo.2006.09.001_bib004 article-title: An elementary algorithm for reporting intersections of red/blue curve segments publication-title: Computational Geometry: Theory Applications doi: 10.1016/S0925-7721(01)00026-8 – volume: 1 start-page: 133 issue: 2 year: 1986 ident: 10.1016/j.comgeo.2006.09.001_bib010 article-title: Fractional cascading: I. A data structuring technique publication-title: Algorithmica doi: 10.1007/BF01840440 – volume: 33 start-page: 66 issue: 1 year: 1986 ident: 10.1016/j.comgeo.2006.09.001_bib021 article-title: An implicit data structure supporting insertion, deletion, and search in o(log2n) time publication-title: Journal of Computer and System Sciences doi: 10.1016/0022-0000(86)90043-7 – volume: 237 start-page: 159 issue: 1–2 year: 2000 ident: 10.1016/j.comgeo.2006.09.001_bib015 article-title: Asymptotically efficient in-place merging publication-title: Theoretical Computer Science doi: 10.1016/S0304-3975(98)00162-5 – ident: 10.1016/j.comgeo.2006.09.001_bib005 doi: 10.1016/j.comgeo.2006.03.006 – volume: vol. 3608 start-page: 146 year: 2005 ident: 10.1016/j.comgeo.2006.09.001_bib026 article-title: Line-segment intersection made in-place – ident: 10.1016/j.comgeo.2006.09.001_bib008 doi: 10.1145/800057.808674 – volume: 32 start-page: 580 year: 1992 ident: 10.1016/j.comgeo.2006.09.001_bib017 article-title: Stable minimum space partitioning in linear time publication-title: BIT: Computer Science doi: 10.1007/BF01994842 – volume: 25 start-page: 285 issue: 3 year: 1987 ident: 10.1016/j.comgeo.2006.09.001_bib024 article-title: Stable unmerging in linear time and constant space publication-title: Information Processing Letters doi: 10.1016/0020-0190(87)90202-X – volume: 7 start-page: 347 issue: 6 year: 1964 ident: 10.1016/j.comgeo.2006.09.001_bib027 article-title: Algorithm 232: Heapsort publication-title: Communications of the ACM doi: 10.1145/512274.512284 – volume: 321 start-page: 25 issue: 1 year: 2004 ident: 10.1016/j.comgeo.2006.09.001_bib007 article-title: Space-efficient planar convex hull algorithms publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2003.05.004 – start-page: 211 year: 1995 ident: 10.1016/j.comgeo.2006.09.001_bib001 article-title: An optimal algorithm for finding segments [sic!] intersections – year: 2004 ident: 10.1016/j.comgeo.2006.09.001_bib016 – volume: 31 start-page: 301 issue: 4 year: 1994 ident: 10.1016/j.comgeo.2006.09.001_bib018 article-title: Sorting multisets stably in minimum space publication-title: Acta Informatica doi: 10.1007/BF01178508 – volume: 302 start-page: 191 issue: 1–3 year: 2003 ident: 10.1016/j.comgeo.2006.09.001_bib012 article-title: Optimizing stable in-place merging publication-title: Theoretical Computer Science doi: 10.1016/S0304-3975(02)00775-2 – volume: 39 start-page: 1 issue: 1 year: 1992 ident: 10.1016/j.comgeo.2006.09.001_bib009 article-title: An optimal algorithm for intersecting line segments in the plane publication-title: Journal of the ACM doi: 10.1145/147508.147511 – volume: 7 start-page: 701 issue: 12 year: 1964 ident: 10.1016/j.comgeo.2006.09.001_bib014 article-title: Algorithm 245: Treesort publication-title: Communications of the ACM doi: 10.1145/355588.365103 – ident: 10.1016/j.comgeo.2006.09.001_bib025 – volume: 6 start-page: 351 issue: 2 year: 1977 ident: 10.1016/j.comgeo.2006.09.001_bib022 article-title: Stable sorting and merging with optimal space and time bounds publication-title: SIAM Journal on Computing doi: 10.1137/0206025 |
| SSID | ssj0002259 |
| Score | 1.8152384 |
| Snippet | We present a space-efficient algorithm for reporting all
k intersections induced by a set of
n line segments in the plane. Our algorithm is an in-place variant... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 213 |
| SubjectTerms | In-place algorithms Line-segment intersection Space-efficient algorithms |
| Title | Line-segment intersection made in-place |
| URI | https://dx.doi.org/10.1016/j.comgeo.2006.09.001 |
| Volume | 38 |
| WOSCitedRecordID | wos000249488900007&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0925-7721 databaseCode: AIEXJ dateStart: 19950301 customDbUrl: isFulltext: true dateEnd: 20180131 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0002259 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9wwELbo0kM5IF4VlIdyqNQDcpXY3rV9RAgESCAOUO0t8vqxFEFAm21F_z3j2A4pIB4HLlEU5WV_I3vGM_4-hL7b3AkincBCjRhmRhVYUmMwGxGuC6IsEa4Rm-AnJ2I4lKdRzb5u5AR4VYm7O3n7oVDDNQDbb519B9ztS-ECnAPocATY4fgm4CG6tLi24ybL79kgJrUNeuDXyniKENzUYXW90iDtkJYFx_bm2k4n_7ZjzYfPwjeUrp1cd8Lpl_LlehdRevoomlpaReBtPVq7HOhlbXnYrZxGRio6FkD_G-ZoZ8YkIbPyZDAO6wKXvi_HYaPl4GegB32YfFLC_dGc1FYKpiK0yzK8xctmDspc-lq8T2iW8L4UPTS7c7g3PGpnYBijAsdibFPaMtnU9T39m-ddko6bcbaA5mN8kO0EXBfRjK2W0NxxS65bL6MfXYSzLsKZRzhLCK-g8_29s90DHPUusIbAbYqZlRCO90ciJ4oR5QrW13LguAW8nKDa9QutjBsIUzCuIW7W3LnC5BBkSsOIoV9Rr7qp7CrKpNJKM-2dTco8556EPuEQyxtKpeH5GqKpyaWOZPBek-SqfKnD1xBun7oNZCiv3M9Tb5bRoQuOWgkm8uKT3975pXX05cGqN1BvOvljN9Fn_Xf6u55sRfu4BzK2bEs |
| linkProvider | Elsevier |
| 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=Line-segment+intersection+made+in-place&rft.jtitle=Computational+geometry+%3A+theory+and+applications&rft.au=Vahrenhold%2C+Jan&rft.date=2007-10-01&rft.issn=0925-7721&rft.volume=38&rft.issue=3&rft.spage=213&rft.epage=230&rft_id=info:doi/10.1016%2Fj.comgeo.2006.09.001&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_comgeo_2006_09_001 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-7721&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-7721&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-7721&client=summon |