Search Results - "Nonnumerical Algorithms and Problems—geometrical problems and computations"

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams by Bennett, H., Papadopoulou, E., Yap, C.

“…Let X = {f1, …, fn} be a set of scalar functions of the form fi : ℝ2 → ℝ which satisfy some natural properties. We describe a subdivision algorithm for…”
Get full text

Radial contour labeling with straight leaders by Niedermann, Benjamin, Nollenburg, Martin, Rutter, Ignaz

“…The usefulness of technical drawings as well as scientific illustrations such as medical drawings of human anatomy essentially depends on the placement of…”
Get full text

New Bounds on the Size of Optimal Meshes by Sheehy, Donald R.

“…The theory of optimal size meshes gives a method for analyzing the output size (number of simplices) of a Delaunay refinement mesh in terms of the integral of…”
Get full text

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions by Larsson, Thomas, Källberg, Linus

“…In this paper, an algorithm is introduced that computes an arbitrarily fine approximation of the smallest enclosing ball of a point set in any dimension. This…”
Get full text

Fleshing: Spine-driven Bending with Local Volume Preservation by Zhuo, Wei, Rossignac, Jarek

“…Several design and animation techniques use a one‐dimensional proxy C (a spine curve in 3D) to control the deformation or behavior of a digital model of a 3D…”
Get full text

Improved grid map layout by point set matching by Eppstein, David, van Kreveld, Marc, Speckmann, Bettina, Staals, Frank

“…Associating the regions of a geographic subdivision with the cells of a grid is a basic operation that is used in various types of maps, like spatially ordered…”
Get full text

Approximate topological matching of quadrilateral meshes by Eppstein, D., Goodrich, M.T., Kim, E., Tamstorf, R.

“…We study approximate topological matching of quadrilateral meshes, that is, the problem of finding as large a set as possible of matching portions of two…”
Get full text

A new approach to rectangle intersections part I by Edelsbrunner, Herbert

“…Rectangle intersections involving rectilinearly-oriented (hyper-) rectangles in d-dimensional real space are examined from two points of view. First, a data…”
Get full text

A new approach to rectangle intersections: Part II by Edelsbrunner, Herbert

“…The study begun in Part I is completed by providing an algorithm which reports all intersecting pairs of a set of rectangles in d dimensions. This approach…”
Get full text