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 place. Our algorithm is an in-place variant of Balaban’s algorithm and runs in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 157 |
|---|---|
| container_issue | |
| container_start_page | 146 |
| container_title | |
| container_volume | |
| creator | Vahrenhold, Jan |
| description | We present a space-efficient algorithm for reporting all k intersections induced by a set of n line segments in the place. Our algorithm is an in-place variant of Balaban’s algorithm and runs in \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$\mathcal{O}(n log^2_2 n + k)$\end{document} time using \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$\mathcal{O}$\end{document}(1) extra words of memory over and above the space used for the input to the algorithm. |
| doi_str_mv | 10.1007/11534273_14 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17116287</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17116287</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-35122c5e59339d4084da40fbd3d431fa8f3c5073c8c622115078dd72c6e886f63</originalsourceid><addsrcrecordid>eNpNkE1LxDAYhOMXuLvuyT-wFxEP0ffNmzbJURY_FioK6jlkk3SpdtvS9OK_t2U9eBqYeRiYYewS4RYB1B1iRlIosiiP2NIoTZkEQoWIx2yGOSInkuaEzadAaASEUzYDAsGNknTO5il9AYBQRszYdVE1kb_H3T42w2rTDLFP0Q9V26xeXIijw99q5-MFOytdneLyTxfs8_HhY_3Mi9enzfq-4J1AM3DKUAifxcwQmSBBy-AklNtAQRKWTpfkM1Dktc-FGLeA0iEo4fOodV7mtGBXh97OJe_qsneNr5Lt-mrv-h877cyFViN3c-DSGDW72Ntt234ni2Cnm-y_m-gXcHhRrA</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Line-Segment Intersection Made In-Place</title><source>Springer Books</source><creator>Vahrenhold, Jan</creator><contributor>Dehne, Frank ; Sack, Jörg-Rüdiger ; López-Ortiz, Alejandro</contributor><creatorcontrib>Vahrenhold, Jan ; Dehne, Frank ; Sack, Jörg-Rüdiger ; López-Ortiz, Alejandro</creatorcontrib><description>We present a space-efficient algorithm for reporting all k intersections induced by a set of n line segments in the place. Our algorithm is an in-place variant of Balaban’s algorithm and runs in \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$\mathcal{O}(n log^2_2 n + k)$\end{document} time using \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$\mathcal{O}$\end{document}(1) extra words of memory over and above the space used for the input to the algorithm.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540281010</identifier><identifier>ISBN: 9783540281016</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540317111</identifier><identifier>EISBN: 3540317112</identifier><identifier>DOI: 10.1007/11534273_14</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Computational Geometry ; Computer science; control theory; systems ; Exact sciences and technology ; Extra Space ; Priority Queue ; Recursive Call ; Theoretical computing ; Vertical Strip</subject><ispartof>Algorithms and Data Structures, 2005, p.146-157</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11534273_14$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11534273_14$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,776,777,781,786,787,790,4036,4037,27906,38236,41423,42492</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17116287$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Dehne, Frank</contributor><contributor>Sack, Jörg-Rüdiger</contributor><contributor>López-Ortiz, Alejandro</contributor><creatorcontrib>Vahrenhold, Jan</creatorcontrib><title>Line-Segment Intersection Made In-Place</title><title>Algorithms and Data Structures</title><description>We present a space-efficient algorithm for reporting all k intersections induced by a set of n line segments in the place. Our algorithm is an in-place variant of Balaban’s algorithm and runs in \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$\mathcal{O}(n log^2_2 n + k)$\end{document} time using \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$\mathcal{O}$\end{document}(1) extra words of memory over and above the space used for the input to the algorithm.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Computational Geometry</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Extra Space</subject><subject>Priority Queue</subject><subject>Recursive Call</subject><subject>Theoretical computing</subject><subject>Vertical Strip</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540281010</isbn><isbn>9783540281016</isbn><isbn>9783540317111</isbn><isbn>3540317112</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkE1LxDAYhOMXuLvuyT-wFxEP0ffNmzbJURY_FioK6jlkk3SpdtvS9OK_t2U9eBqYeRiYYewS4RYB1B1iRlIosiiP2NIoTZkEQoWIx2yGOSInkuaEzadAaASEUzYDAsGNknTO5il9AYBQRszYdVE1kb_H3T42w2rTDLFP0Q9V26xeXIijw99q5-MFOytdneLyTxfs8_HhY_3Mi9enzfq-4J1AM3DKUAifxcwQmSBBy-AklNtAQRKWTpfkM1Dktc-FGLeA0iEo4fOodV7mtGBXh97OJe_qsneNr5Lt-mrv-h877cyFViN3c-DSGDW72Ntt234ni2Cnm-y_m-gXcHhRrA</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Vahrenhold, Jan</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Line-Segment Intersection Made In-Place</title><author>Vahrenhold, Jan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-35122c5e59339d4084da40fbd3d431fa8f3c5073c8c622115078dd72c6e886f63</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Computational Geometry</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Extra Space</topic><topic>Priority Queue</topic><topic>Recursive Call</topic><topic>Theoretical computing</topic><topic>Vertical Strip</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Vahrenhold, Jan</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Vahrenhold, Jan</au><au>Dehne, Frank</au><au>Sack, Jörg-Rüdiger</au><au>López-Ortiz, Alejandro</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Line-Segment Intersection Made In-Place</atitle><btitle>Algorithms and Data Structures</btitle><date>2005</date><risdate>2005</risdate><spage>146</spage><epage>157</epage><pages>146-157</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540281010</isbn><isbn>9783540281016</isbn><eisbn>9783540317111</eisbn><eisbn>3540317112</eisbn><abstract>We present a space-efficient algorithm for reporting all k intersections induced by a set of n line segments in the place. Our algorithm is an in-place variant of Balaban’s algorithm and runs in \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$\mathcal{O}(n log^2_2 n + k)$\end{document} time using \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$\mathcal{O}$\end{document}(1) extra words of memory over and above the space used for the input to the algorithm.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11534273_14</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Algorithms and Data Structures, 2005, p.146-157 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17116287 |
| source | Springer Books |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Computational Geometry Computer science control theory systems Exact sciences and technology Extra Space Priority Queue Recursive Call Theoretical computing Vertical Strip |
| title | Line-Segment Intersection Made In-Place |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T21%3A42%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Line-Segment%20Intersection%20Made%20In-Place&rft.btitle=Algorithms%20and%20Data%20Structures&rft.au=Vahrenhold,%20Jan&rft.date=2005&rft.spage=146&rft.epage=157&rft.pages=146-157&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540281010&rft.isbn_list=9783540281016&rft_id=info:doi/10.1007/11534273_14&rft_dat=%3Cpascalfrancis_sprin%3E17116287%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540317111&rft.eisbn_list=3540317112&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |