Fiona Wood
ABSTRACT
Voronoi diagrams, found in the morphology of many biological structures, produce natural-looking networks of cells in two dimensions. But creating three dimensional models of cell layers in biological tissue is difficult when the tissue has a complex shape. I present a new method that constrains a Voronoi diagram to an arbitrary surface. Unlike other approaches, my method does not require computationally expensive boundary intersection calculations.
- Mackercher, P. A., Ivey, K. J., Baskin, W. N., and Krause, W. J. 1978. A scanning electron microscopic study of normal human oxyntic mucosa using blunt dissection and freeze fracture. Am J Dig Dis 23, 5, 449--59.Google Scholar
Cross Ref
- Yan, D.-M., Wang, W., Lévy, B., and Liu, Y. 2010. Efficient computation of 3d clipped voronoi diagram. In Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing, Springer-Verlag, Berlin, Heidelberg, GMP'10, 269--282. Google ScholarDigital Library
Index Terms
Modeling cell layers on complex surfaces using constrained Voronoi diagrams
Recommendations
Branching tubular surfaces based on spherical Voronoi diagrams
AbstractThe surface around the branching region of multiple tubes is usually with complex geometry. Especially when the tubes are with varying radius and arbitrary orientation, it is not trivial to find the branching surface of the tubes. We ...
Graphical abstractDisplay Omitted
Highlights- A new structure to connect tubular surfaces with different poses and sizes.
- A ...
Geodesic Voronoi Diagrams on Parametric Surfaces
CGI '97: Proceedings of the 1997 Conference on Computer Graphics InternationalIn this paper we extend the concept of Voronoi diagrams to parameterized surfaces where distance between two points is defined as infimum over the lengths of surface paths connecting these points. We present a method to compute Voronoi diagrams on these ...
Voronoi diagrams on the sphere
Given a set of compact sites on a sphere, we show that their spherical Voronoi diagram can be computed by computing two planar Voronoi diagrams of suitably transformed sites in the plane. We also show that a planar furthest-site Voronoi diagram can ...
Comments