Suchergebnisse - Nonnumerical Algorithms AND Problems – Geometrical problems AND computations

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

“… We describe a subdivision algorithm for computing a clustered ε‐isotopic approximation of the minimization diagram of X …”
Volltext

New Bounds on the Size of Optimal Meshes von 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 …”
Volltext

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions von 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 …”
Volltext

Radial contour labeling with straight leaders von 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 …”
Volltext

Improved grid map layout by point set matching von 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 …”
Volltext

Fleshing: Spine-driven Bending with Local Volume Preservation von 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 …”
Volltext

Manifold Homotopy via the Flow Complex von Sadri, Bardia

“… It is known that the critical points of the distance function induced by a dense sample P of a submanifold Σ of ℝn are distributed into two groups, one lying …”
Volltext

Approximate topological matching of quadrilateral meshes von 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 quadrilateral meshes …”
Volltext

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

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

A new approach to rectangle intersections: Part II von 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 …”
Volltext

A Theory of Network Localization von Aspnes, J., Eren, T., Goldenberg, D.K., Morse, A.S., Whiteley, W., Yang, Y.R., Anderson, B.D.O., Belhumeur, P.N.

“… In this paper, we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors …”
Volltext

EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS von DATTA, AMITAVA

“… We present an optimal parallel construction of the range tree data structure and use this construction to solve several geometric partitioning problems …”
Volltext