91 search results - page 15 / 19 » Triangulating a Plane |
BIRTHDAY
2003
Springer
14 years 4 months ago
2003
Springer
We discuss the design of Java applets that visualize how the Voronoi diagram of n points continuously changes as individual points are moved across the plane, or as the underlying...
DAGM
2003
Springer
14 years 4 months ago
2003
Springer
We present an approach to parallel variational optical flow computation by using an arbitrary partition of the image plane and iteratively solving related local variational proble...
MFCS
1994
Springer
14 years 2 months ago
1994
Springer
We show that the wavefront approach to Voronoi diagrams (a deterministic line sweep algorithm that does not use geometric transform) can be generalized to distance measures more g...
ESA
2000
Springer
14 years 2 months ago
2000
Springer
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...
DMTCS
2010
13 years 8 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...