Lecture

From STL to SLI and CLI

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

ME-413: Introduction to additive manufacturing

The state of the art in the domain of additive production processes (the part is built by material addition without use of a shape tool) will be presented. The main application/benefits/shortcomings of the common additive processes as well as technologi ...

Description

This lecture covers the process of transforming a .STL file into a .SLI file by intersecting a polyhedron with planes, spaced by a layer thickness, and then installing segments into the .SLI file. It also explains the transformation from .SLI to .CLI format by filling polygons with broken lines, detailing the standard algorithm and the different types of filling algorithms. The lecture delves into the localization of points in a polygon based on view angles, intersection criteria for point localization, and the Gauss Law in 2D electromagnetics. It concludes with information on the computational rules for view angles of oriented segments and the transformation process from .SLI to .CLI format.

Instructors (3)

Eric Boillat

Contact Microcity Phone: 41 21 69 54456 Teaching & PhD Past EPFL PhD Students as codirector Serguei Kolossov, Cédric André, Jamasp Jhabvala, Christoph Van Gestel, Tatiana Polivnikova, Nikola Kalentics Courses Industrial production processes ME-212 Application windows of the main manufacturing process categories. Implementation of simple models describing the behavior of the main manufacturing processes. Basic understanding of the economic aspects of production processes. Manufacturing proc

Jürgen Brugger

I am a Professor of Microengineering and co-affiliated to Materials Science. Before joining EPFL I was at the MESA Research Institute of Nanotechnology at the University of Twente in the Netherlands, at the IBM Zurich Research Laboratory, and at the Hitachi Central Research Laboratory, in Tokyo, Japan. I received a Master in Physical-Electronics and a PhD degree from Neuchâtel University, Switzerland. Research in my laboratory focuses on various aspects of MEMS and Nanotechnology. My group contributes to the field at the fundamental level as well as in technological development, as demonstrated by the start-ups that spun off from the lab. In our research, key competences are in micro/nanofabrication, additive micro-manufacturing, new materials for MEMS, increasingly for wearable and biomedical applications. Together with my students and colleagues we published over 200 peer-refereed papers and I had the pleasure to supervise over 25 PhD students. Former students and postdocs have been successful in receiving awards and starting their own scientific careers. I am honoured for the appointment in 2016 as Fellow of the IEEE “For contributions to micro and nano manufacturing technology”. In 2017 my lab was awarded an ERC AdvG in the field of advanced micro-manufacturing.

Christophe Moser

Dr. Christophe Moser is Associate Professor of Microengineering and Industrial Relations at the Swiss Federal Institute of Technology in Lausanne. He was the co-founder and CEO of Ondax,Inc for ten years prior to joining EPFL. During this decade, he raised $15 million from corporate and venture capital sources to fund volume production of thick holographic components in glass and develop devices enabled by these components such as tunable add-drop multiplexers for telecommunications, ultra-narrowband notch filters for low frequency Raman systems, high power semi-conductor frequency-narrowed pumps for fiber lasers, single frequency fixed and tunable lasers for sensing and femtosecond pulse compressors for micro-machining applications. Dr. Moser has a Ph.D. in Electrical Engineering from the California Institute of Technology, a minor in finance and a bachelor degree in Physics from EPFL. He is the co-inventor of 24 patents, 14 peer reviewed scientific publications, 9 IEEE proceedings and a book chapter. Private interests include tennis, running, ski, basketball and family excursions. 2010: Associate Professor, EPFL, faculty Science Technique Ingenieur. 2000-2010: co-founder, CEO Ondax, Inc. 1995-2000: Graduate Research Assistant, California Institute of Technology. 1993-1995: Engineering Project manager , TESA. 1988-1993: Bachelor candidate in Physics, EPFL. MAIN PUBLICATIONS:

Moser C., Havermeyer F,.Ultra-narrowband tunable laserline notch filter, Appl. Phys. B, 95 (3), pp 597-601, 2009.

Moser C. ,Ho L., Havermeyer F,. Self-aligned Non-dispersive External Cavity Tunable Laser, 16 (21), 16691-16696 Optics Express, 2008.

Steckman, GJ , Moser C. et al. Volume holographic grating wavelength stabilized laser diodes, IEEE J. Of Selected Topics in Quantum Electronics, (13), 672-678, 2007.

Buse K, Havermeyer F, Liu W., Moser C, Psaltis D. Holographic Filters , Book Chapter Photorefractive Materials and their Applications, 2005.

Havermeyer, F; Liu, WH; Moser, C, et al. Volume holographic grating-based continuously tunable optical filter , Opt. Eng. 43 (9), 2017-2021, 2004.

Moser C., Maravic I., Schupp B., Adibi A, Psaltis D, Diffraction efficiency of localized holograms in doubly doped LiNbO3 crystals, Opt. Lett. 25: (17),1243-1245, 2000.

Official source

Ontological neighbourhood

Mathematics

Geometry: Euclidean geometry

Related concepts (32)

Polyhedron

In geometry, a polyhedron (: polyhedra or polyhedrons; ) is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices. A convex polyhedron is a polyhedron that bounds a convex set. Every convex polyhedron can be constructed as the convex hull of its vertices, and for every finite set of points, not all on the same plane, the convex hull is a convex polyhedron. Cubes and pyramids are examples of convex polyhedra. A polyhedron is a 3-dimensional example of a polytope, a more general concept in any number of dimensions.

Skew polygon

In geometry, a skew polygon is a polygon whose vertices are not all coplanar. Skew polygons must have at least four vertices. The interior surface (or area) of such a polygon is not uniquely defined. Skew infinite polygons (apeirogons) have vertices which are not all colinear. A zig-zag skew polygon or antiprismatic polygon has vertices which alternate on two parallel planes, and thus must be even-sided. Regular skew polygons in 3 dimensions (and regular skew apeirogons in two dimensions) are always zig-zag.

Honeycomb (geometry)

In geometry, a honeycomb is a space filling or close packing of polyhedral or higher-dimensional cells, so that there are no gaps. It is an example of the more general mathematical tiling or tessellation in any number of dimensions. Its dimension can be clarified as n-honeycomb for a honeycomb of n-dimensional space. Honeycombs are usually constructed in ordinary Euclidean ("flat") space. They may also be constructed in non-Euclidean spaces, such as hyperbolic honeycombs.

Line segment

In geometry, a line segment is a part of a straight line that is bounded by two distinct end points, and contains every point on the line that is between its endpoints. The length of a line segment is given by the Euclidean distance between its endpoints. A closed line segment includes both endpoints, while an open line segment excludes both endpoints; a half-open line segment includes exactly one of the endpoints. In geometry, a line segment is often denoted using a line above the symbols for the two endpoints (such as ).

Vertex figure

In geometry, a vertex figure, broadly speaking, is the figure exposed when a corner of a polyhedron or polytope is sliced off. Take some corner or vertex of a polyhedron. Mark a point somewhere along each connected edge. Draw lines across the connected faces, joining adjacent points around the face. When done, these lines form a complete circuit, i.e. a polygon, around the vertex. This polygon is the vertex figure. More precise formal definitions can vary quite widely, according to circumstance.

Related lectures (45)

Topology of Riemann Surfaces

Covers the topology of Riemann surfaces and the concept of triangulation using finitely many triangles.

PDF Faro Scene: Adobe Photoshop Workflow

Demonstrates the workflow using Adobe Photoshop to prepare a PDF for precise insertion in AutoCAD.

Polygons & Polyhedra: Regular & Starred

Explores polygons, polyhedra, regularity, and starred configurations in Euclidean geometry, highlighting historical context and limitations.

Solid Identification: Coordinates and Orientation

Covers the identification of a solid in space using 6 coordinates and the concept of undeformable solid bodies.

Polygonal Lines: Definitions and Examples