Pith. sign in

REVIEW 1 cited by

Hyperbolic Voronoi diagrams made easy

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0903.3287 v1 pith:EY3OFWTU submitted 2009-03-19 cs.CG

classification cs.CG
keywords diagramshyperbolicdiskvoronoiballsbisectorscomputingpower
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We present a simple framework to compute hyperbolic Voronoi diagrams of finite point sets as affine diagrams. We prove that bisectors in Klein's non-conformal disk model are hyperplanes that can be interpreted as power bisectors of Euclidean balls. Therefore our method simply consists in computing an equivalent clipped power diagram followed by a mapping transformation depending on the selected representation of the hyperbolic space (e.g., Poincar\'e conformal disk or upper-plane representations). We discuss on extensions of this approach to weighted and $k$-order diagrams, and describe their dual triangulations. Finally, we consider two useful primitives on the hyperbolic Voronoi diagrams for designing tailored user interfaces of an image catalog browsing application in the hyperbolic disk: (1) finding nearest neighbors, and (2) computing smallest enclosing balls.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach

    cs.LG 2025-06 conditional novelty 6.0 of 10

    Fast-HyperDT reexpresses HyperDT as pre- and post-processing around standard Euclidean trees, making hyperbolic random forests practical.

Pith tools