최성희 교수
SungHee Choi
KAIST 전산학부 · 컴퓨터과학
연구실 소개
최성희 교수의 연구실은 삼차원 표면 재구성, 델로뉴 삼각화 및 메디얼 축계산을 중심으로 한 기하학적 계산 기반의 연구를 수행합니다. 특히 점군으로부터 정확하고 안정적인 표면 메쉬와 메디얼 축을 복원하는 알고리즘 개발에 초점을 맞추며, 실세계의 3D 데이터를 효과적으로 처리할 수 있는 알고리즘 프레임워크를 구축하고자 합니다. 또한, CNC 공작 기계의 정밀도 향상과 함께 대용량 작업공간을 확보한 헥사포드 기반 가공 로봇의 설계 및 제어 기술에 대한 연구도 진행 중입니다.
연구 현황
연구 성과 추이
표시된 성과는 수집된 데이터 기준으로 산출되며, 일부 차이가 있을 수 있습니다.
주요 논문
15The power crust is a construction which takes a sample of points from the surface of a three-dimensional object and produces a surface mesh and an approximate medial axis. The approach is to first approximate the medial axis transform (MAT) of the object. We then use an inverse transform to produce the surface representation from the MAT.This idea leads to a simple algorithm with theoretical guarantees comparable to those of other surface reconstruction and medial axis approximation algorithms.
The Delaunay triangulation of a set of points in 3D can size Th (n2) in the worst case, but this is rarely if ever observed in practice. We compare three production-quality Delaunay triangulation programs on some 'real-world' sets of points lying on or near 2D surfaces
This paper presents a computational framework for providing affective labels to real-life situations, called A-Situ. We first define an affective situation, as a specific arrangement of affective entities relevant to emotion elicitation in a situation. Then, the affective situation is represented as a set of labels in the valence-arousal emotion space. Based on psychological behaviors in response to a situation, the proposed framework quantifies the expected emotion evoked by the interaction wit
Given a surface mesh F in R 3 with vertex set S and consisting of Delaunay triangles, we want to construct the Delaunay tetrahedralization of S.We present an algorithm which constructs the Delaunay tetrahedralization of S given a bounded degree spanning subgraph T of F. It accelerates the incremental Delaunay triangulation construction by exploiting the connectivity of the points on the surface. If the expected size of the Delaunay triangulation is linear, we prove that our algorithm runs in O(n
In nowadays, CNC machines are capable of achieve nanoscale precision. Also, many researches are being conducted in order to further improve the accuracy of the machined parts. On the contrary, we focused on a machining platform with a larger work space. In this study, we propose a hexapod machining robot, which can move to the desired location and perform machining. This robot can be viewed as a combination of a machining platform and hexapod robot. Its hardware design and control algorithms wil
대표 연구 분야
최성희 교수의 연구를 Nubint에서 더 깊이 살펴보세요
이 연구실의 논문을 앱에서 열어 AI와 함께 읽고, 핵심을 요약하고, 내 글에 인용하세요.