Everything about Multiple line segment intersection

🧭 Start here: a 6-step reading path

1. Read the overview: Multiple line segment intersectionA 5-minute orientation
2. Pick up a classic book: Masonry skillsThe most-reprinted book on the subject
3. Go sideways: Bentley–Ottmann algorithmA closely related topic
4. Go sideways: Sweep line algorithmA closely related topic

🏆 Landmark papers (most cited)

• No matching papers found.

📚 Books worth reading

• Masonry skillsR. T. Kreh, Richard T. Kreh · 1976
• Stained glass for dummiesVicki Payne · 2010
• 📕Sequel to the First Six Books of the Elements of EuclidJohn Casey · 1910
• Coding the MatrixPhilip N. Klein · 2013
• প্রোগ্রামিং কনটেস্টমোঃ মাহবুবুল হাসান · 2016
• 📕ICTE 2015China) International Conference On Transportation Engineering (5th 2015 Dalian Shi · 2015
• A TOUR OF THE WORLDMalik Mansab Khan, Muhammad Rafique Abdul Aziz · 2025

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Bentley–Ottmann algorithm In computational geometry, the Bentley–Ottmann algorithm is a sweep line algorithm for listing all crossings in a set of line segments, i.e. it finds the…
• Sweep line algorithm In computational geometry, a sweep line algorithm or plane sweep algorithm is an algorithmic paradigm that uses a conceptual sweep line or sweep surface…
• Computational geometry Computational geometry is a branch of computer science devoted to the study of algorithms that can be stated in terms of geometry. Some purely geometrical…
• Smallest-circle problem The smallest-circle problem (also known as minimum covering circle problem, bounding circle problem, least bounding circle problem, smallest enclosing…
• Closest pair of points problem The closest pair of points problem or closest pair problem is a problem of computational geometry: given n {\displaystyle n} points in metric space, find…
• Hidden-line removal In 3D computer graphics, solid objects are usually modeled by polyhedra. A face of a polyhedron is a planar polygon bounded by straight line segments,…
• Planarity Planarity is a 2005 puzzle computer game by John Tantalo, based on a concept by Mary Radcliffe at Western Michigan University. The name comes from the…
• Simple polygon In geometry, a simple polygon is a polygon that does not intersect itself and has no holes. That is, it is a piecewise-linear Jordan curve consisting of…