Pages that link to "Item:Q749241"
From MaRDI portal
The following pages link to An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations (Q749241):
Displaying 5 items.
- A connectivity graph generation approach for Manhattan path calculation in detailed facility layout (Q274980) (← links)
- Efficient minimum spanning tree construction with Delaynay triangulation (Q1847389) (← links)
- Persistent homology in \(\ell_\infty\) metric (Q2064022) (← links)
- ``The big sweep'': On the power of the wavefront approach to Voronoi diagrams (Q2365174) (← links)
- “The big sweep”: On the power of the wavefront approach to Voronoi diagrams (Q5096887) (← links)
