Results 1  10
of
941
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 534 (11 self)
 Add to MetaCart
The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms
Algebraic Decision Diagrams and their Applications
, 1993
"... In this paper we present theory and experiments on the Algebraic Decision Diagrams (ADD's). These diagrams extend BDD's by allowing values from an arbitrary finite domain to be associated with the terminal nodes. We present a treatment founded in boolean algebras and discuss algorithms and ..."
Abstract

Cited by 321 (18 self)
 Add to MetaCart
In this paper we present theory and experiments on the Algebraic Decision Diagrams (ADD's). These diagrams extend BDD's by allowing values from an arbitrary finite domain to be associated with the terminal nodes. We present a treatment founded in boolean algebras and discuss algorithms
Diagrams
, 2010
"... The algebra of symmetric functions, the representation theory of the symmetric group, and the geometry of the Grassmannian are related to each other via Schur functions, Specht modules, and Schubert varieties, all of which are indexed by partitions and their Young diagrams. We will generalize these ..."
Abstract
 Add to MetaCart
these objects to allow for not just Young diagrams but arbitrary collections of boxes or, equally well, bipartite graphs. We will then provide evidence for a conjecture that the relation between the areas described above can be extended to these general diagrams. In particular, we will prove the conjecture
The hyperbolic Voronoi diagram in arbitrary dimension
, 2014
"... We show that in the Klein projective ball model of hyperbolic space, the hyperbolic Voronoi diagram is affine and amounts to clip a corresponding power diagram, requiring however algebraic arithmetic. By considering the lesserknown Beltrami hemisphere model of hyperbolic geometry, we overcome the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We show that in the Klein projective ball model of hyperbolic space, the hyperbolic Voronoi diagram is affine and amounts to clip a corresponding power diagram, requiring however algebraic arithmetic. By considering the lesserknown Beltrami hemisphere model of hyperbolic geometry, we overcome
The Voronoi diagram of three arbitrary lines in R³
"... In this paper we study the Voronoi diagram of lines in R³. The Voronoi diagram of three lines in general position was studied in [14]. In this paper we complete this work by presenting a complete characterization of the Voronoi diagram of three arbitrary lines in R³. As in the general case, we prove ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we study the Voronoi diagram of lines in R³. The Voronoi diagram of three lines in general position was studied in [14]. In this paper we complete this work by presenting a complete characterization of the Voronoi diagram of three arbitrary lines in R³. As in the general case, we
kVoronoi diagrams computing in arbitrary domains
 In Proc. IEEE International Conference on Image Processing
, 2003
"... ABSTRACT We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation called occlusion points propagation geodesic distance transformation (OPPGDT) which is robust and linear in the d ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
ABSTRACT We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation called occlusion points propagation geodesic distance transformation (OPPGDT) which is robust and linear
Verification of Arithmetic Circuits with Binary Moment Diagrams
 IN PROCEEDINGS OF THE 32ND ACM/IEEE DESIGN AUTOMATION CONFERENCE
, 1995
"... Binary Moment Diagrams (BMDs) provide a canonical representations for linear functions similar to the way Binary Decision Diagrams (BDDs) represent Boolean functions. Within the class of linear functions, we can embed arbitrary functions from Boolean variables to integer values. BMDs can thus model ..."
Abstract

Cited by 110 (10 self)
 Add to MetaCart
Binary Moment Diagrams (BMDs) provide a canonical representations for linear functions similar to the way Binary Decision Diagrams (BDDs) represent Boolean functions. Within the class of linear functions, we can embed arbitrary functions from Boolean variables to integer values. BMDs can thus model
Phase diagram of the . . .
, 2007
"... We study the zerotemperature partition function of the Potts antiferromagnet (i.e., the chromatic polynomial) on a torus using a transfermatrix approach. We consider square and triangularlattice strips with fixed width L, arbitrary length N, and fully periodic boundary conditions. On the mathema ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We study the zerotemperature partition function of the Potts antiferromagnet (i.e., the chromatic polynomial) on a torus using a transfermatrix approach. We consider square and triangularlattice strips with fixed width L, arbitrary length N, and fully periodic boundary conditions
THE DISCRETE GEODESIC PROBLEM
, 1987
"... We present an algorithm for determining the shortest path between a source and a destination on an arbitrary (possibly nonconvex) polyhedral surface. The path is constrained to lie on the surface, and distances are measured according to the Euclidean metric. Our algorithm runs in time O(n log n) and ..."
Abstract

Cited by 180 (1 self)
 Add to MetaCart
We present an algorithm for determining the shortest path between a source and a destination on an arbitrary (possibly nonconvex) polyhedral surface. The path is constrained to lie on the surface, and distances are measured according to the Euclidean metric. Our algorithm runs in time O(n log n
A linear time algorithm for computing exact Euclidean distance transforms of binary images in arbitrary dimensions
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2003
"... Abstract—A sequential algorithm is presented for computing the exact Euclidean distance transform (DT) of a kdimensional binary image in time linear in the total number of voxelsN. The algorithm, which is based on dimensionality reduction and partial Voronoi diagram construction, can be used for co ..."
Abstract

Cited by 101 (3 self)
 Add to MetaCart
Abstract—A sequential algorithm is presented for computing the exact Euclidean distance transform (DT) of a kdimensional binary image in time linear in the total number of voxelsN. The algorithm, which is based on dimensionality reduction and partial Voronoi diagram construction, can be used
Results 1  10
of
941