Results 1  10
of
195,194
Dynamic HamSandwich Cuts in the Plane
, 2005
"... We design efficient data structures for dynamically maintaining a hamsandwich cut of two point sets in the plane subject to insertions and deletions of points in either set. A hamsandwich cut is a line that simultaneously bisects the cardinality of both point sets. For general point sets, our first ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We design efficient data structures for dynamically maintaining a hamsandwich cut of two point sets in the plane subject to insertions and deletions of points in either set. A hamsandwich cut is a line that simultaneously bisects the cardinality of both point sets. For general point sets, our
Abstract Dynamic HamSandwich Cuts of Convex Polygons in the Plane
"... We provide an efficient data structure for dynamically maintaining a hamsandwich cut of two nonoverlapping convex polygons in the plane. Given two nonoverlapping convex polygons P1 and P2 in the plane, the hamsandwich cut of P1 and P2 is a line that simultaneously bisects the area (or perimeter o ..."
Abstract
 Add to MetaCart
We provide an efficient data structure for dynamically maintaining a hamsandwich cut of two nonoverlapping convex polygons in the plane. Given two nonoverlapping convex polygons P1 and P2 in the plane, the hamsandwich cut of P1 and P2 is a line that simultaneously bisects the area (or perimeter
Constructing HamSandwich Cuts in the Plane
"... In continuation of the necklace splitting / hamsandwich cut problem... However, knowing about the existence of such a line certainly is not good enough. It is easy to turn the proof given above into an O(n2) algorithm to construct a line that simultaneously bisects both sets. But we can do better. ..."
Abstract
 Add to MetaCart
In continuation of the necklace splitting / hamsandwich cut problem... However, knowing about the existence of such a line certainly is not good enough. It is easy to turn the proof given above into an O(n2) algorithm to construct a line that simultaneously bisects both sets. But we can do better
Dynamic HamSandwich Cuts for Two Overlapping Point Sets
"... We provide an efficient data structure for dynamically maintaining a hamsandwich cut of two overlapping point sets in convex position in the plane. The hamsandwich cut of S1 and S2 is a line that simultaneously bisects the area, perimeter or vertex count of both point sets. Our algorithm supports ..."
Abstract
 Add to MetaCart
We provide an efficient data structure for dynamically maintaining a hamsandwich cut of two overlapping point sets in convex position in the plane. The hamsandwich cut of S1 and S2 is a line that simultaneously bisects the area, perimeter or vertex count of both point sets. Our algorithm supports
HamSandwich Cuts and Other Tasks in Arrangements
"... Given a set L = {# 1 ,...,# n } of n lines in general position in the plane and subsets A and B of vertices in the arrangement A(L), the goal is to find a line that simultaneously bisects both A and B.WegiveanO(n(logn) 2 ) algorithm for this task, in the special case where A and B are the v ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
are the vertices in di#erent halfspaces, and an O(n(log n) 3 ) algorithm for nonseparated cases. These statements should be compared to an# (n log n) lower bound, and to the O(n 2 ) complexity of the known hamsandwich algorithm that is optimal for arbitrary sets of size O(n 2 ) but which does
Dynamic HamSandwich Cuts for Two Point Sets with Bounded ConvexHullPeeling Depth
"... We provide an efficient data structure for dynamically maintaining a hamsandwich cut of two (possibly overlapping) point sets in the plane, with a bounded number of convexhull peeling layers. The hamsandwich cut of S1 and S2 is a line that simultaneously bisects the area, perimeter or vertex coun ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We provide an efficient data structure for dynamically maintaining a hamsandwich cut of two (possibly overlapping) point sets in the plane, with a bounded number of convexhull peeling layers. The hamsandwich cut of S1 and S2 is a line that simultaneously bisects the area, perimeter or vertex
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
as follows: ffl We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. ffl We present several efficient dynamic drawing algorithms for trees, seriesparallel digraphs, planar stdigraphs, and planar
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 622 (6 self)
 Add to MetaCart
Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular
Results 1  10
of
195,194