Maarten L offler Marc van Kreveld Center for Geometry, Imaging - - PowerPoint PPT Presentation

maarten l offler marc van kreveld
SMART_READER_LITE
LIVE PREVIEW

Maarten L offler Marc van Kreveld Center for Geometry, Imaging - - PowerPoint PPT Presentation

Maarten L offler Marc van Kreveld Center for Geometry, Imaging and Virtual Environments Utrecht University ? PROPERTIES OF IMPRECISE POINTS ? PROPERTIES OF IMPRECISE POINTS connected ? PROPERTIES OF IMPRECISE POINTS connected


slide-1
SLIDE 1

Maarten L¨

  • ffler

Marc van Kreveld

Center for Geometry, Imaging and Virtual Environments

Utrecht University

slide-2
SLIDE 2
slide-3
SLIDE 3
slide-4
SLIDE 4
slide-5
SLIDE 5
slide-6
SLIDE 6
slide-7
SLIDE 7
slide-8
SLIDE 8
slide-9
SLIDE 9
slide-10
SLIDE 10

?

slide-11
SLIDE 11

PROPERTIES OF IMPRECISE POINTS

?

slide-12
SLIDE 12

PROPERTIES OF IMPRECISE POINTS

  • connected

?

slide-13
SLIDE 13

PROPERTIES OF IMPRECISE POINTS

  • connected
  • convex

?

slide-14
SLIDE 14

PROPERTIES OF IMPRECISE POINTS

  • connected
  • convex
  • polygonal

?

slide-15
SLIDE 15

PROPERTIES OF IMPRECISE POINTS

  • connected
  • convex
  • polygonal
  • constant

?

slide-16
SLIDE 16

PROPERTIES OF IMPRECISE POINTS

  • connected
  • convex
  • polygonal
  • constant

PROPERTIES OF IMPRECISE LINES

slide-17
SLIDE 17

PROPERTIES OF IMPRECISE POINTS

  • connected
  • convex
  • polygonal
  • constant

PROPERTIES OF

  • connected

IMPRECISE LINES

slide-18
SLIDE 18

PROPERTIES OF IMPRECISE POINTS

  • connected
  • convex
  • polygonal
  • constant

PROPERTIES OF

  • connected
  • convex?

IMPRECISE LINES

slide-19
SLIDE 19

PROPERTIES OF IMPRECISE POINTS

  • connected
  • convex
  • polygonal
  • constant

PROPERTIES OF

  • connected
  • convex?
  • polygonal?

IMPRECISE LINES

slide-20
SLIDE 20

PROPERTIES OF IMPRECISE POINTS

  • connected
  • convex
  • polygonal
  • constant

PROPERTIES OF

  • connected
  • convex?
  • polygonal?
  • constant?

IMPRECISE LINES

slide-21
SLIDE 21

WHAT ARE CONVEX SETS OF LINES?

slide-22
SLIDE 22

WHAT ARE CONVEX SETS OF LINES?

  • let’s use duality!
slide-23
SLIDE 23

WHAT ARE CONVEX SETS OF LINES?

  • let’s use duality!
slide-24
SLIDE 24

WHAT ARE CONVEX SETS OF LINES?

  • let’s use duality!
slide-25
SLIDE 25

WHAT ARE CONVEX SETS OF LINES?

  • let’s use duality!
slide-26
SLIDE 26

WHAT ARE CONVEX SETS OF LINES?

  • let’s use duality!
  • problem: vertical lines
slide-27
SLIDE 27

WHAT ARE CONVEX SETS OF LINES?

  • let’s use duality!
  • problem: vertical lines
slide-28
SLIDE 28

WHAT ARE CONVEX SETS OF LINES?

  • let’s use duality!
  • problem: vertical lines
slide-29
SLIDE 29

WHAT ARE CONVEX SETS OF LINES?

  • let’s use duality!
  • problem: vertical lines
  • different mapping?
slide-30
SLIDE 30

WHAT ARE CONVEX SETS OF LINES?

  • let’s use duality!
  • problem: vertical lines
  • different mapping?
slide-31
SLIDE 31

WHAT ARE CONVEX SETS OF LINES?

  • let’s use duality!
  • problem: vertical lines
  • different mapping?

[Rosenfeld, 1995]

slide-32
SLIDE 32

WHAT ARE CONVEX SETS OF LINES?

slide-33
SLIDE 33

WHAT ARE CONVEX SETS OF LINES?

  • desirable properties of convex hull
  • connectivity
  • anti-exchange property
  • affine transformation invariant
slide-34
SLIDE 34

WHAT ARE CONVEX SETS OF LINES?

  • desirable properties of convex hull
  • connectivity
  • anti-exchange property
  • affine transformation invariant
slide-35
SLIDE 35

WHAT ARE CONVEX SETS OF LINES?

  • desirable properties of convex hull
  • connectivity
  • anti-exchange property
  • affine transformation invariant

[Goodman, 1998]

  • no such definition exists!
slide-36
SLIDE 36

WHAT ARE CONVEX SETS OF LINES?

  • desirable properties of convex hull
  • connectivity
  • anti-exchange property
  • affine transformation invariant

[Goodman, 1998]

  • no such definition exists!
  • drop connectivity?
slide-37
SLIDE 37

WHAT ARE CONVEX SETS OF LINES?

  • desirable properties of convex hull
  • connectivity
  • anti-exchange property
  • affine transformation invariant

[Goodman, 1998]

  • no such definition exists!
  • drop connectivity?
slide-38
SLIDE 38

WHAT ARE CONVEX SETS OF LINES?

  • desirable properties of convex hull
  • connectivity
  • anti-exchange property
  • affine transformation invariant

[Goodman, 1998]

  • no such definition exists!
  • drop connectivity?
slide-39
SLIDE 39

WHAT ARE CONVEX SETS OF LINES?

[Gates, 1993]

slide-40
SLIDE 40

WHAT ARE CONVEX SETS OF LINES?

[Gates, 1993]

  • what about directed lines?
slide-41
SLIDE 41

WHAT ARE CONVEX SETS OF LINES?

[Gates, 1993]

  • what about directed lines?
slide-42
SLIDE 42

WHAT ARE CONVEX SETS OF LINES?

[Gates, 1993]

  • what about directed lines?
slide-43
SLIDE 43

WHAT ARE CONVEX SETS OF LINES?

[Gates, 1993]

  • what about directed lines?
slide-44
SLIDE 44

WHAT ARE CONVEX SETS OF LINES?

[Gates, 1993]

  • what about directed lines?
  • imprecise lines have a

“general direction”

slide-45
SLIDE 45

WHAT ARE CONVEX SETS OF LINES?

slide-46
SLIDE 46

WHAT ARE CONVEX SETS OF LINES?

  • a set of lines L is convex when:
slide-47
SLIDE 47

WHAT ARE CONVEX SETS OF LINES?

  • a set of lines L is convex when:
  • there is a line d /

∈ L such that no line in L is parallel to d d

slide-48
SLIDE 48

WHAT ARE CONVEX SETS OF LINES?

  • a set of lines L is convex when:
  • there is a line d /

∈ L such that no line in L is parallel to d d

  • if ℓ, ℓ′ ∈ L, all lines between

ℓ and ℓ′ are also in L

slide-49
SLIDE 49

WHAT ARE CONVEX SETS OF LINES?

  • a set of lines L is convex when:
  • there is a line d /

∈ L such that no line in L is parallel to d d

  • if ℓ, ℓ′ ∈ L, all lines between

ℓ and ℓ′ are also in L

slide-50
SLIDE 50

WHAT ARE CONVEX SETS OF LINES?

  • a set of lines L is convex when:
  • there is a line d /

∈ L such that no line in L is parallel to d d

  • if ℓ, ℓ′ ∈ L, all lines between

ℓ and ℓ′ are also in L

slide-51
SLIDE 51

WHAT ARE CONVEX SETS OF LINES?

  • a set of lines L is convex when:
  • there is a line d /

∈ L such that no line in L is parallel to d d

  • if ℓ, ℓ′ ∈ L, all lines between

ℓ and ℓ′ are also in L

slide-52
SLIDE 52

WHAT ARE CONVEX SETS OF LINES?

  • a set of lines L is convex when:
  • there is a line d /

∈ L such that no line in L is parallel to d d

  • if ℓ, ℓ′ ∈ L, all lines between

ℓ and ℓ′ are also in L

  • convex hull not defined
slide-53
SLIDE 53

WHAT ARE CONVEX SETS OF LINES?

  • a set of lines L is convex when:
  • there is a line d /

∈ L such that no line in L is parallel to d d

  • if ℓ, ℓ′ ∈ L, all lines between

ℓ and ℓ′ are also in L

  • convex hull not defined
  • given by boundary
slide-54
SLIDE 54

WHAT ARE CONVEX SETS OF LINES?

  • a set of lines L is convex when:
  • there is a line d /

∈ L such that no line in L is parallel to d d

  • if ℓ, ℓ′ ∈ L, all lines between

ℓ and ℓ′ are also in L

  • convex hull not defined
  • given by boundary
  • limit angle α

α

slide-55
SLIDE 55

PROPERTIES OF IMPRECISE LINES

  • connected
  • convex
slide-56
SLIDE 56

PROPERTIES OF IMPRECISE LINES

  • connected
  • convex
  • polygonal
slide-57
SLIDE 57

PROPERTIES OF IMPRECISE LINES

  • connected
  • convex
  • polygonal
  • constant
slide-58
SLIDE 58

EXAMPLE: LINEAR PROGRAMMING

  • important, well known problem
slide-59
SLIDE 59

EXAMPLE: LINEAR PROGRAMMING

  • given set of directed lines
  • important, well known problem
slide-60
SLIDE 60

EXAMPLE: LINEAR PROGRAMMING

  • given set of directed lines
  • determine the lowest point

to the left of all lines

  • important, well known problem
slide-61
SLIDE 61

EXAMPLE: LINEAR PROGRAMMING

  • given set of directed lines
  • determine the lowest point

to the left of all lines

  • important, well known problem
  • takes O(n) time
slide-62
SLIDE 62

EXAMPLE: LINEAR PROGRAMMING

slide-63
SLIDE 63

EXAMPLE: LINEAR PROGRAMMING

  • given set of imprecise directed lines
slide-64
SLIDE 64

EXAMPLE: LINEAR PROGRAMMING

  • given set of imprecise directed lines
  • determine all possible heights
  • f the lowest point

to the left of all lines

slide-65
SLIDE 65

EXAMPLE: LINEAR PROGRAMMING

  • given set of imprecise directed lines
  • determine all possible heights
  • f the lowest point

to the left of all lines

  • lowest possible point
slide-66
SLIDE 66

EXAMPLE: LINEAR PROGRAMMING

  • given set of imprecise directed lines
  • determine all possible heights
  • f the lowest point

to the left of all lines

  • lowest possible point
  • highest possible point
slide-67
SLIDE 67

HIGHEST VALUE

slide-68
SLIDE 68

HIGHEST VALUE

  • only consider left borders of bundles
  • find lowest point to the left of those
slide-69
SLIDE 69

HIGHEST VALUE

  • only consider left borders of bundles
  • apply convex programming
  • takes O(n) time
  • find lowest point to the left of those
slide-70
SLIDE 70

LOWEST VALUE

slide-71
SLIDE 71

LOWEST VALUE

  • only consider right borders of bundles
  • find lowest point to the left of those
slide-72
SLIDE 72

LOWEST VALUE

  • only consider right borders of bundles
  • find lowest point to the left of those
  • takes Θ(n2) time
slide-73
SLIDE 73

LOWEST VALUE

  • only consider right borders of bundles
  • find lowest point to the left of those
  • takes Θ(n2) time
  • if α < 180◦ − c

it takes Θ(n log n) time

slide-74
SLIDE 74

Questions? Thank You!