✦ LIBER ✦

Pebble Sets in Convex Polygons

✍ Scribed by Kevin Iga; Randall Maddox

Publisher: Springer
Year: 2007
Tongue: English
Weight: 494 KB
Volume: 38
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-007-9030-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Empty convex polygons in almost convex s

Empty convex polygons in almost convex sets

✍ Pavel Valtr; Gábor Lippner; Gyula Károlyi 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 139 KB

Covering convex sets with non-overlappin

Covering convex sets with non-overlapping polygons

✍ Herbert Edelsbrunner; Arch D. Robison; Xiao-Jun Shen 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 721 KB

An isoperimetric inequality for convex p

An isoperimetric inequality for convex polygons and convex sets with the same symmetrals

✍ Marco Longinetti 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 512 KB

Intervertex distances in convex polygons

✍ Paul Erdös; Peter Fishburn 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 496 KB

Finding Convex Sets in Convex Position

✍ Géza Tóth 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 162 KB

Ray Shooting Amidst Convex Polygons in 2

Ray Shooting Amidst Convex Polygons in 2D

✍ Pankaj K. Agarwal; Micha Sharir 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 220 KB

We consider the problem of ray shooting in a two-dimensional scene consisting of m convex polygons with a total of n edges. We present a data structure that Ž . requires O mn log m space and preprocessing time and that answers a ray Ž 2 2 . shooting query in O log m log n time. If the polygons are p