Light in power

We present in this paper a generic and parameter-free algorithm to efficiently build a wide variety of optical components, such as mirrors or lenses, that satisfy some light energy constraints. In all of our problems, one is given a collimated or point light source and a desired illumination after reflection or refraction and the goal is to design the geometry of a mirror or lens which transports exactly the light emitted by the source onto the target. We first propose a general framework and show that eight different optical component design problems amount to solving a Light Energy Conservation equation that involves the computation of Visibility diagrams. We show that these diagrams all have the same structure and can be obtained by intersecting a 3D Power Diagram with a planar or spherical domain. This allows us to propose an efficient and fully generic algorithm capable to solve the eight optical component design problems. Our solutions can satisfy design constraints such as convexity or concavity and are always graphs over the plane or the sphere. We show the effectiveness of our algorithm on numerous simulated examples.

[1]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[2]  Peter Alfeld,et al.  A trivariate clough-tocher scheme for tetrahedral data , 1984, Comput. Aided Geom. Des..

[3]  Franz Aurenhammer,et al.  Power Diagrams: Properties, Algorithms and Applications , 1987, SIAM J. Comput..

[4]  L. Caffarelli,et al.  On the Numerical Solution of the Problem of Reflector Design with Given Far-Field Scattering Data , 1999 .

[5]  V. Oliker,et al.  Optical Design of Single Reflector Systems and the Monge–Kantorovich Mass Transfer Problem , 2003 .

[6]  Xu-jia Wang On the design of a reflector antenna II , 2004 .

[7]  Gustavo Patow,et al.  A Survey of Inverse Surface Design From Light Transport Behavior Specification , 2005, Comput. Graph. Forum.

[8]  이현주 Q. , 2005 .

[9]  L. Caffarelli,et al.  Weak solutions of one inverse problem in geometric optics , 2008 .

[10]  L. Caffarelli,et al.  On the Regularity of Reflector Antennas , 2008 .

[11]  Qingbo Huang,et al.  The Refractor Problem in Reshaping Light Beams , 2009 .

[12]  Tim Weyrich,et al.  Fabricating microgeometry for custom surface reflectance , 2009, ACM Trans. Graph..

[13]  Hendrik P. A. Lensch,et al.  Geometry Construction from Caustic Images , 2010, ECCV.

[14]  Tim Weyrich,et al.  Goal‐based Caustics , 2011, Comput. Graph. Forum.

[15]  Quentin Mérigot,et al.  A Multiscale Approach to Optimal Transport , 2011, Comput. Graph. Forum.

[16]  Mathieu Desbrun,et al.  Blue noise through optimal transport , 2012, ACM Trans. Graph..

[17]  Kei Iwasaki,et al.  Pixel Art with Refracted Light by Rearrangeable Sticks , 2012, Comput. Graph. Forum.

[19]  The Parallel Refractor , 2013 .

[20]  Andrea Tagliasacchi,et al.  High-contrast computational caustic design , 2014, ACM Trans. Graph..

[21]  Kei Iwasaki,et al.  Poisson-Based Continuous Surface Generation for Goal-Based Caustics , 2014, ACM Trans. Graph..

[22]  J. Mirebeau Discretization of the 3D Monge-Ampere operator, between Wide Stencils and Power Diagrams , 2015, 1503.00947.

[23]  Quentin Mérigot,et al.  Far-field reflector problem and intersection of paraboloids , 2016, Numerische Mathematik.

[24]  Marc Alexa,et al.  Directional screens , 2017, SCF.

[25]  Q. Mérigot,et al.  A Newton algorithm for semi-discrete optimal transport with storage fees and quantitative convergence of cells , 2019, SIAM J. Optim..

[26]  A. Figalli On the Monge-Ampère equation , 2019 .