Académique Documents
Professionnel Documents
Culture Documents
Computacional
comp-420
Geometra Computacional
Entrada:
Salida:
Problemas estticos:
Diagrama de Voronoi.
Algoritmos de visibilidad
Problemas estticos
Bsqueda de rango:
Localizacin de un punto:
Vecino ms cercano.
Trazado de rayos
Problemas de bsqueda geomtrica
o wecompute
Dado un theconjunto de puntos
convex hull? Before Pwe=can {p1answer
, p2 , . . .this } en el plano,
, pnquestion we calcular una
sk anotherlista que contenga
question: whataquellos puntos
does it mean to de P que the
compute sean vrtices
convex hull?de CH(P ), en
ordenthedeconvex
have seen, las manecillas
hull of Pdel
is areloj.
convex polygon. A natural way
esent aentrada:
polygonconjunto
is by listing its vertices p in
, pclockwise
de puntos 1 2 3 4 5 6 7 8 , p9 .
p , , p , p , p order,
, p , pstarting
n arbitrary one. So the problem we want to solve is this: given a set
p1 , p2, .salida:
. . , pn }representacin del envolvente
of points in the plane, compute aconvexo
list that contains , p2 , p9 .
p4 , p5 , p8those
from P that are the vertices of CH(P), listed in clockwise order.
p9
p4
t = set of points:
p2 , p 3 , p4 , p 5 , p 6 , p 7 , p 8 , p 9 p7 p1
p2
ut = representation of the convex hull: p6 p3
p5 Figure 1.1
p5 , p 8 , p2 , p 9
p8 Computing a conve
e1
e2
origin of e1