Consistent Digital Curved Rays and Pseudoline Arrangements

Representing a family of geometric objects in the digital world where each object is represented by a set of pixels is a basic problem in graphics and computational geometry. One important criterion is the consistency, where the intersection pattern of the objects should be consistent with axioms of the Euclidean geometry, e.g., the intersection of two lines should be a single connected component. Previously, the set of linear rays and segments has been considered. In this paper, we extended this theory to families of curved rays going through the origin. We further consider some psudoline arrangements obtained as unions of such families of rays

Shape from periodic texture using the eigenvectors of local affine distortion

This paper shows how the local slant and tilt angles of regularly textured curved surfaces can be estimated directly, without the need for iterative numerical optimization, We work in the frequency domain and measure texture distortion using the affine distortion of the pattern of spectral peaks. The key theoretical contribution is to show that the directions of the eigenvectors of the affine distortion matrices can be used to estimate local slant and tilt angles of tangent planes to curved surfaces. In particular, the leading eigenvector points in the tilt direction. Although not as geometrically transparent, the direction of the second eigenvector can be used to estimate the slant direction. The required affine distortion matrices are computed using the correspondences between spectral peaks, established on the basis of their energy ordering. We apply the method to a variety of real-world and synthetic imagery

Conoids and Hyperbolic Paraboloids in Le Corbusier’s Philips Pavilion

The Philips Pavilion at the Brussels World Fair is the first of Le Corbusier’s architectural works to connect the evolution of his mathematical thought on harmonic series and modular coordination with the idea of three-dimensional continuity. This propitious circumstance was the consequence of his collaboration with Iannis Xenakis, whose profound interest in mathematical structures was improved on his becaming acquainted with the Modulor, while at the same time Le Corbusier encountered double ruled quadric surfaces. For the Philips Pavilion—the Poème Électronic—Corbusier entrusted Xenakis with a “mathematical translation” of his sketches, which represented the volume of a rounded bottle with a stomach-shaped plan. The Pavilion was designed as if it were an orchestral work in which lights, loudspeakers, film projections on curved surfaces, spectators’ shadows and their expression of wonder, objects hanging from the ceiling and the containing space itself were all virtual instrument

Computing a rectilinear shortest path amid splinegons in plane

We reduce the problem of computing a rectilinear shortest path between two given points s and t in the splinegonal domain \calS to the problem of computing a rectilinear shortest path between two points in the polygonal domain. As part of this, we define a polygonal domain \calP from \calS and transform a rectilinear shortest path computed in \calP to a path between s and t amid splinegon obstacles in \calS. When \calS comprises of h pairwise disjoint splinegons with a total of n vertices, excluding the time to compute a rectilinear shortest path amid polygons in \calP, our reduction algorithm takes O(n + h \lg{n}) time. For the special case of \calS comprising of concave-in splinegons, we have devised another algorithm in which the reduction procedure does not rely on the structures used in the algorithm to compute a rectilinear shortest path in polygonal domain. As part of these, we have characterized few of the properties of rectilinear shortest paths amid splinegons which could be of independent interest