Sciweavers

94 search results - page 14 / 19
» Visibility Graphs of Point Sets in the Plane
Sort
View
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
14 years 2 months ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz
SI3D
2009
ACM
14 years 2 months ago
Soft irregular shadow mapping: fast, high-quality, and robust soft shadows
We introduce a straightforward, robust, and efficient algorithm for rendering high-quality soft shadows in dynamic scenes. Each frame, points in the scene visible from the eye ar...
Gregory S. Johnson, Warren A. Hunt, Allen Hux, Wil...
ICCV
2009
IEEE
15 years 14 days ago
Piecewise Planar Stereo for Image-based Rendering
We present a novel multi-view stereo method designed for image-based rendering that generates piecewise planar depth maps from an unordered collection of photographs. First a di...
Sudipta N. Sinha, Drew Steedly and Richard Szelisk...
SMA
2009
ACM
134views Solid Modeling» more  SMA 2009»
14 years 2 months ago
Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
DAM
2011
13 years 2 months ago
Untangling planar graphs from a specified vertex position - Hard cases
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...