There are not too many magic configurations

15 years 6 months ago

Download sci.haifa.ac.il

A finite planar point set P is called a magic configuration if there is an assignment of positive weights to the points of P such that, for every line l determined by P, the sum of the weights

Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom

Real-time Traffic

COMPGEOM 2007 | Discrete Geometry | Finite Planar Point | Positive Weights |

claim paper

» Metawire Using FPGA configuration circuitry to emulate a NetworkonChip

» The robust shortest path problem with interval data via Benders decomposition

» ClosedForm Solution to Nonrigid 3D Surface Registration

» Learning to play Tetris applying reinforcement learning methods

» Resourceaware exploration of the emergent dynamics of simulated systems

» A complexityeffective architecture for accelerating fullsystem multiprocessor simulations ...

» The Mobile Agents Integrated Field Test

» Reducing memory fragmentation in network applications with dynamic memory allocators optim...

Post Info
More Details (n/a)

Added	14 Aug 2010
Updated	14 Aug 2010
Type	Conference
Year	2007
Where	COMPGEOM
Authors	Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote

Comments (0)

Sciweavers

There are not too many magic configurations

COMPGEOM 2007 | Discrete Geometry | Finite Planar Point | Positive Weights |

Explore & Download

Productivity Tools

Sciweavers