search result

Cover von Faster Approximate Diameter and Distance Oracles in Planar Graphs

Faster Approximate Diameter and Distance Oracles in Planar Graphs

Year: 2017
Media group: LIPIcs
Cover von Applications of Chebyshev Polynomials to Low-Dimensional Computational Geometry

Applications of Chebyshev Polynomials to Low-Dimensional Computational Geometry

Year: 2017
Media group: LIPIcs
Cover von Orthogonal Range Searching in Moderate Dimensions

Orthogonal Range Searching in Moderate Dimensions

k-d Trees and Range Trees Strike Back
Year: 2017
Media group: LIPIcs
Cover von All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time

All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time

Year: 2016
Media group: LIPIcs
Cover von A Clustering-Based Approach to Kinetic Closest Pair

A Clustering-Based Approach to Kinetic Closest Pair

Year: 2016
Media group: LIPIcs
Cover von Two Approaches to Building Time-Windowed Geometric Data Structures

Two Approaches to Building Time-Windowed Geometric Data Structures

Year: 2016
Media group: LIPIcs
Cover von Dynamic Streaming Algorithms for Epsilon-Kernels

Dynamic Streaming Algorithms for Epsilon-Kernels

Year: 2016
Media group: LIPIcs
Cover von A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions

A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions

Year: 2015
Media group: LIPIcs
Cover von A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation

A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation

Year: 2025
Media group: LIPIcs
Cover von Convex Polygon Containment

Convex Polygon Containment

Improving Quadratic to Near Linear Time
Year: 2024
Media group: LIPIcs
OPEN V 11.1.0.0