Results 1  10
of
75,409
DS, “Computation of molecular surface using Euclidean Voronoi diagram
 ComputerAided Design and Applications, Vol.2, Nos. 14
, 2005
"... Given a protein, analyzing the geometric structure of protein is fundamental for the study of a protein folding, docking, interactions between proteins, and so on. One of the important geometric analyses is computing the molecular surface of protein. Discussed in this paper is an efficient algorithm ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
algorithm to compute such a molecular surface of protein via the concept of blending operation among atoms constituting the protein. To facilitate the decision for the existence of blending surface among atoms, we take advantage of the proximity information of Euclidean Voronoi diagram of atoms
Threedimensional Euclidean Voronoi diagrams of lines with a fixed number of orientations
 SIAM J. Comput
, 2002
"... We show that the combinatorial complexity of the Euclidean Voronoi diagram of n lines in R 3 that have at most c distinct orientations is O(c 3 n 2+ε), for any ε> 0. This result is a step towards proving the longstanding conjecture that the Euclidean Voronoi diagram of lines in three dimensions ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
We show that the combinatorial complexity of the Euclidean Voronoi diagram of n lines in R 3 that have at most c distinct orientations is O(c 3 n 2+ε), for any ε> 0. This result is a step towards proving the longstanding conjecture that the Euclidean Voronoi diagram of lines in three dimensions
Abstract A sweepline algorithm for Euclidean Voronoi diagram of circles
, 2005
"... Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a twodimensional Euclidean space. The radii of the circles are nonnegative and not necessarily equal. It is allowed that circles intersect each other, and a circle contains others. The proposed a ..."
Abstract
 Add to MetaCart
Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a twodimensional Euclidean space. The radii of the circles are nonnegative and not necessarily equal. It is allowed that circles intersect each other, and a circle contains others. The proposed
c ○ World Scientific Publishing Company EUCLIDEAN VORONOI DIAGRAM FOR CIRCLES IN A CIRCLE
, 2004
"... Presented in this paper is an algorithm to compute a Euclidean Voronoi diagram for circles contained in a large circle. The radii of circles are not necessarily equal and no circle inside the large circle wholly contains another circle. The proposed algorithm uses the ordinary point Voronoi diagram ..."
Abstract
 Add to MetaCart
Presented in this paper is an algorithm to compute a Euclidean Voronoi diagram for circles contained in a large circle. The radii of circles are not necessarily equal and no circle inside the large circle wholly contains another circle. The proposed algorithm uses the ordinary point Voronoi diagram
Euclidean Voronoi diagram of 3D balls and its computation via tracing edges
, 2005
"... ... known as an additively weighted Voronoi diagram, in 3D space has not been studied as much as it deserves. In this paper, we present an algorithm to compute the Euclidean Voronoi diagram for 3D spheres with different radii. The presented algorithm follows Voronoi edges one by one until the constr ..."
Abstract

Cited by 21 (10 self)
 Add to MetaCart
... known as an additively weighted Voronoi diagram, in 3D space has not been studied as much as it deserves. In this paper, we present an algorithm to compute the Euclidean Voronoi diagram for 3D spheres with different radii. The presented algorithm follows Voronoi edges one by one until
ACMAC’s PrePrint Repository Analysis of the incircle predicate for the Euclidean Voronoi diagram of axesaligned line segments
, 2011
"... ACMAC’s PrePrint Repository aim is to enable open access to the scholarly output of ACMAC. ..."
Abstract
 Add to MetaCart
ACMAC’s PrePrint Repository aim is to enable open access to the scholarly output of ACMAC.
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 531 (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
Construction of Voronoi Diagram on the Upper Halfplane
 IEICE Transactions
, 1995
"... this paper investigates the Voronoi diagram in hyperbolic space. We first present characterizations of this diagram by means of the Euclidean Voronoi diagram, and based on them propose efficient algorithms to construct it. Some applications are also mentioned. ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
this paper investigates the Voronoi diagram in hyperbolic space. We first present characterizations of this diagram by means of the Euclidean Voronoi diagram, and based on them propose efficient algorithms to construct it. Some applications are also mentioned.
Voronoi diagrams  a survey of a fundamental geometric data structure
 ACM COMPUTING SURVEYS
, 1991
"... This paper presents a survey of the Voronoi diagram, one of the most fundamental data structures in computational geometry. It demonstrates the importance and usefulness of the Voronoi diagram in a wide variety of fields inside and outside computer science and surveys the history of its development. ..."
Abstract

Cited by 733 (5 self)
 Add to MetaCart
This paper presents a survey of the Voronoi diagram, one of the most fundamental data structures in computational geometry. It demonstrates the importance and usefulness of the Voronoi diagram in a wide variety of fields inside and outside computer science and surveys the history of its development
Results 1  10
of
75,409