Sciweavers

584 search results - page 65 / 117
» On the Number of Halving Planes
Sort
View
SI3D
1995
ACM
15 years 1 months ago
Interactive Volume Visualization on a Heterogeneous Message-Passing Multicomputer
This paper describes VOL2, an interactive general-purpose volume renderer based on ray casting and implemented on Pixel-Planes 5, a distributed-memory, message-passing multicomput...
Andrei State, Jonathan McAllister, Ulrich Neumann,...
CCCG
2010
14 years 11 months ago
Finding monochromatic l-shapes in bichromatic point sets
Given a set R of red points and a set B of blue points in the plane of total size n, we study the problem of determining all angles for which there exists an L-shape containing al...
Farnaz Sheikhi, Mark de Berg, Ali Mohades, Mansoor...
CCCG
2007
14 years 11 months ago
A Disk-Covering Problem with Application in Optical Interferometry
Given a disk O in the plane called the objective, we want to find n small disks P1, . . . , Pn called the pupils such that n i,j=1 Pi Pj ⊇ O, where denotes the Minkowski diffe...
Trung Nguyen, Jean-Daniel Boissonnat, Fréd&...
CCCG
2007
14 years 11 months ago
Optimal Point Set Partitioning using Rigid Motion Star Placement
We consider the problem of determining the placement of a star R on a set P of n points in the plane such that a given objective function is maximized. A star R is a set of m rays...
Prosenjit Bose, Jason Morrison
SODA
2008
ACM
106views Algorithms» more  SODA 2008»
14 years 11 months ago
Exact and efficient 2D-arrangements of arbitrary algebraic curves
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
Arno Eigenwillig, Michael Kerber