Pages that link to "Item:Q5948530"
From MaRDI portal
The following pages link to Fast algorithms for computing \(\beta\)-skeletons and their relatives. (Q5948530):
Displaying 8 items.
- Efficient edge-skeleton computation for polytopes defined by oracles (Q491253) (← links)
- How \({\beta}\)-skeletons lose their edges (Q497919) (← links)
- A linear-time construction of the relative neighborhood graph from the Delaunay triangulation (Q1334610) (← links)
- Output-sensitive algorithm for computing \(\beta\)-skeletons (Q1840767) (← links)
- On growing connected \(\beta \)-skeletons (Q1947996) (← links)
- New sequential and parallel algorithms for computing the \(\beta\)-spectrum (Q2348036) (← links)
- Sublinear randomized algorithms for skeleton decompositions (Q2866239) (← links)
- GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING (Q5311630) (← links)
