Browsing by Author "Sahillioglu, Yusuf"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item KerGen: A Kernel Computation Algorithm for 3D Polygon Meshes(The Eurographics Association and John Wiley & Sons Ltd., 2024) Asiler, Merve; Sahillioglu, Yusuf; Hu, Ruizhen; Lefebvre, SylvainWe compute the kernel of a shape embedded in 3D as a polygon mesh, which is defined as the set of all points that have a clear line of sight to every point of the mesh. The KerGen algorithm, short for Kernel Generation, employs efficient plane-plane and line-plane intersections, alongside point classifications based on their positions relative to planes. This approach allows for the incremental addition of kernel vertices and edges to the resulting set in a simple and systematic way. The output is a polygon mesh that represents the surface of the kernel. Extensive comparisons with the existing methods, CGAL and Polyhedron Kernel, demonstrate the remarkable timing performance of our novel additive kernel computation method. Yet another advantage of our additive process is the availability of the partial kernel at any stage, making it useful for specific geometry processing applications such as star decomposition and castable shape reconstruction.Item Shape Interpolation via Multiple Curves(The Eurographics Association, 2018) Sahillioglu, Yusuf; Aydinlilar, Melike; Fu, Hongbo and Ghosh, Abhijeet and Kopf, JohannesWe present a method that interpolates new shapes between a given pair of source and target shapes. To this end, we utilize a database of related shapes that is used to replace the direct transition from the source to the target by a composition of small transitions. This so-called data-driven interpolation scheme proved useful as long as the database is sufficiently large. We advance this idea one step further by processing the database shapes part by part, which in turn enables realistic interpolations with relatively small databases. We obtain promising preliminary results and point out potential improvements that we intend to address in our future work.