Geometric Algorithms
discrete & computational geometry ?
See the Wikipedia pages
Computational Geometry
Computational geometry is the study of design and analysis of
algorithms dealing with geometric objects. Therefore the goal of
research is to develop efficient algorithms and data structures
for solving problems stated in terms of basic geometrical objects,
such as points, line segments, polygons, polyhedra, etc.
It emerged as a sub-discipline of theoretical computer science from 1970s, and has grown into a recognized research discipline in computer science and applied mathematics, with a large community of active researchers. It had developed in several directions and forged links with other application domains such as computer aided design, robotics, computer graphics, virtual reality, computer vision, bio-informatics, and geographic information system.
We believe that knowledge of computational geometry is important to solve geometric problems in application areas efficiently.
News and Schedule
- April 17-19 AAAC 2010
- Best paper award at SSTD 2009: "Spatial Skyline Queries: An Efficient Geometric Algorithm" by Wanbin Son, Mu-Woong Lee, Hee-Kap Ahn, Seung-won Hwang.
- July 8-10 SSTD 2009
- July 4-5 WAAC 2009 in Seoul.
- June 20-23 FAW 2009
- Hee-Kap Ahn has been invited to the editorial board of Journal on Computational Geometry.
- Hee-Kap Ahn has been invited to PC of ACM SoCG 2010. SoCG is the only top conference in computational geometry.
- March 2-23 Antoine Vigneron (INRA) and Andreas Holmsen (KAIST) visited us.
