tag:blogger.com,1999:blog-2420860529344694449.post3269470959044472346..comments2024-03-25T02:37:02.982-07:00Comments on Lin.ear th.inking: Monotone Chains: the unknown techniqueDr JTShttp://www.blogger.com/profile/02383381220154739793noreply@blogger.comBlogger5125tag:blogger.com,1999:blog-2420860529344694449.post-85347774357576695042010-06-01T08:32:11.508-07:002010-06-01T08:32:11.508-07:00Line Segment intersection in JTS is accomplished i...Line Segment intersection in JTS is accomplished in a couple of different ways. The core algorithm used in geometry overlay uses a sweep-line index, but it's not full-blown Bentley-Ottman, since it doesn't use a segment-tree index for the sweepline.Dr JTShttps://www.blogger.com/profile/02383381220154739793noreply@blogger.comtag:blogger.com,1999:blog-2420860529344694449.post-36245301191098688392010-06-01T02:03:02.554-07:002010-06-01T02:03:02.554-07:00Thank you for the answer, I saw the MonotoneChainI...Thank you for the answer, I saw the MonotoneChainIndexer Class. I took a look at Line-Segment intersection too: is it based on the Bentley-Ottmann algorithm, which use a sweep line and two data structure? <br />Sorry for my bad english and thank you so much.Anonymoushttps://www.blogger.com/profile/06174142076529960374noreply@blogger.comtag:blogger.com,1999:blog-2420860529344694449.post-49521450295764662842010-05-31T08:46:46.441-07:002010-05-31T08:46:46.441-07:00danidif,
The algorithm to build monotone chains f...danidif,<br /><br />The algorithm to build monotone chains from arbitrary edges is pretty straightforward. Basically it just walks through the sequence of points, and creates a new chain any time moving to the next coordinate would violate the monotonicity constraint. Check out the MonotoneChainIndexer class in the JTS source.Dr JTShttps://www.blogger.com/profile/02383381220154739793noreply@blogger.comtag:blogger.com,1999:blog-2420860529344694449.post-5452285301327272542010-05-31T06:39:03.170-07:002010-05-31T06:39:03.170-07:00Hi Martin, I want to ask you which is the techinqu...Hi Martin, I want to ask you which is the techinque used on JTS for obtaining monotone chains from a Geometry such as Polygons or LineString. Thank you in advanceAnonymoushttps://www.blogger.com/profile/06174142076529960374noreply@blogger.comtag:blogger.com,1999:blog-2420860529344694449.post-52517906167429609692008-10-29T05:50:00.000-07:002008-10-29T05:50:00.000-07:00It is looking very interesting, now i'll try to lo...It is looking very interesting, now i'll try to look into this algorithm. It is semms better in the sense of memory consuming (as you point it in article) than balanced binary trees. <BR/>Thank you!вввhttps://www.blogger.com/profile/17984033683415321035noreply@blogger.com