Editing Implicit surface (section)

== Visualization of implicit surfaces ==
There are various algorithms for [[rendering (computer graphics)|rendering]] implicit surfaces,<ref name="BloomenthalBajaj1997">{{cite book|author1=Jules Bloomenthal|author2=Chandrajit Bajaj|author3=Brian Wyvill|title=Introduction to Implicit Surfaces|url=https://books.google.com/books?id=T3SSqIVnS4YC&q=%22implicit+surface%22+rendering|date=15 August 1997|publisher=Morgan Kaufmann|isbn=978-1-55860-233-5}}</ref> including the [[marching cubes algorithm]].<ref name="Stephenson2004">{{cite book|author=Ian Stephenson|title=Production Rendering: Design and Implementation|url=https://books.google.com/books?id=krTfLA5b940C|date=1 December 2004|publisher=Springer Science & Business Media|isbn=978-1-85233-821-3}}</ref> Essentially there are two ideas for visualizing an implicit surface: One generates a net of polygons which is visualized (see [[surface triangulation]]) and the second relies on [[Ray tracing (graphics)|ray tracing]] which determines intersection points of rays with the surface.<ref>Eric Haines, Tomas Akenine-Moller: ''Ray Tracing Gems'', Springer, 2019, {{ISBN|978-1-4842-4427-2}}</ref> The intersection points can be approximated by ''sphere tracing'', using a [[signed distance function]] to find the distance to the surface.<ref>{{Cite book|last1=Hardy|first1=Alexandre|url=https://books.google.com/books?id=IGtIWmM2GWIC&dq=%22sphere+tracing%22&pg=PA369|title=Mathematical Tools in Computer Graphics with C# Implementations|last2=Steeb|first2=Willi-Hans|date=2008|publisher=World Scientific|isbn=978-981-279-102-3|language=en}}</ref>