Results 1  10
of
16,324
Applications of Random Sampling in Computational Geometry, II
 Discrete Comput. Geom
, 1995
"... We use random sampling for several new geometric algorithms. The algorithms are "Las Vegas," and their expected bounds are with respect to the random behavior of the algorithms. These algorithms follow from new general results giving sharp bounds for the use of random subsets in geometric ..."
Abstract

Cited by 432 (12 self)
 Add to MetaCart
(A + n log n) expected time, where A is the number of intersecting pairs reported. The algorithm requires O(n) space in the worst case. Another algorithm computes the convex hull of n points in E d in O(n log n) expected time for d = 3, and O(n bd=2c ) expected time for d ? 3. The algorithm also
Computational Geometry
 in optimization 2.5D and 3D NC surface machining. Computers in Industry
, 1996
"... Introduction Computational geometry evolves from the classical discipline of design and analysis of algorithms, and has received a great deal of attention in the last two decades since its inception in 1975 by M. Shamos[108]. It is concerned with the computational complexity of geometric problems t ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Introduction Computational geometry evolves from the classical discipline of design and analysis of algorithms, and has received a great deal of attention in the last two decades since its inception in 1975 by M. Shamos[108]. It is concerned with the computational complexity of geometric problems
ExternalMemory Computational Geometry
"... In this paper, we give new techniques for designing efficient algorithms for computational geometry problems that are too large to be solved in internal memory, and we use these techniques to develop optimal and practical algorithms for a number of important largescale problems. We discuss our algo ..."
Abstract

Cited by 120 (14 self)
 Add to MetaCart
In this paper, we give new techniques for designing efficient algorithms for computational geometry problems that are too large to be solved in internal memory, and we use these techniques to develop optimal and practical algorithms for a number of important largescale problems. We discuss our
Computational Geometry
"... s of Talks Army Research Office and MSI Stony Brook Workshop on COMPUTATIONAL GEOMETRY October 1416, 1993 Brownestone Hotel Raleigh, North Carolina Hosted by the Department of Computer Science North Carolina State University Sponsored by the U.S. Army Research Office, and the Mathematical Scienc ..."
Abstract
 Add to MetaCart
s of Talks Army Research Office and MSI Stony Brook Workshop on COMPUTATIONAL GEOMETRY October 1416, 1993 Brownestone Hotel Raleigh, North Carolina Hosted by the Department of Computer Science North Carolina State University Sponsored by the U.S. Army Research Office, and the Mathematical
Computational Geometry
, 2000
"... Most scenarios for accelerating muons require recirculating acceleration. A racetrack shape for the accelerator requires particles with lower energy in early passes to traverse almost the same length of arc as particles with the highest energy. This extra arc length may lead to excess decays and ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
and excess cost. Changing the geometry to a “dogbone ” shape, where there is a single linac and the beam turns completely around at the end of the linac, returning to the same end of the linac from which it exited, addresses this problem. In this design, the arc lengths can be proportional to the particle
Dynamic Algorithms in Computational Geometry
, 1992
"... Research on dynamic algorithms for geometric problems has received increasing attention in the last years, and is motivated by many important applications in circuit layout, computer graphics, and computeraided design. In this paper we survey dynamic algorithms and data structures in the area of co ..."
Abstract

Cited by 92 (7 self)
 Add to MetaCart
of computational geometry. Our work has a twofold purpose: it introduces the area to the nonspecialist and reviews the stateoftheart for the specialist.
Computational Geometry
"... Tarasov & Vyalyi [1] propose an O(n log n) algorithm for computing contour trees over 3dimensional scalar fields. Although theoretically sound, the algorithm involves a large constant of proportionality, and may introduce artefacts into the dataset. It does, however, suggest an alternate approa ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Tarasov & Vyalyi [1] propose an O(n log n) algorithm for computing contour trees over 3dimensional scalar fields. Although theoretically sound, the algorithm involves a large constant of proportionality, and may introduce artefacts into the dataset. It does, however, suggest an alternate
Computational Geometry
, 1997
"... This report contains the abstracts of all the 29 talks, in the order as they were given at the meeting, as well as abstracts of the problems presented at the open problem session. Compiled by Rolf Klein (open problem session based on notes by Ricky Pollack). Contents ..."
Abstract
 Add to MetaCart
This report contains the abstracts of all the 29 talks, in the order as they were given at the meeting, as well as abstracts of the problems presented at the open problem session. Compiled by Rolf Klein (open problem session based on notes by Ricky Pollack). Contents
Results 1  10
of
16,324