Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Orphan-Free Anisotropic Voronoi Diagrams (1102.3670v1)

Published 17 Feb 2011 in cs.CG

Abstract: We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in any number of dimensions. These conditions are natural for problems in optimization and approximation, and algorithms already exist to produce sets of sites that satisfy them.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Guillermo D. Canas (6 papers)
  2. Steven J. Gortler (42 papers)
Citations (18)

Summary

We haven't generated a summary for this paper yet.