#### Filter Results:

- Full text PDF available (23)

#### Publication Year

2000

2018

- This year (8)
- Last 5 years (21)
- Last 10 years (33)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Nina Amenta, Sunghee Choi, Ravi Krishna Kolluri
- Symposium on Solid Modeling and Applications
- 2001

The <i>power crust</i> 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… (More)

- Nina Amenta, Sunghee Choi, Tamal K. Dey, N. Leekha
- Symposium on Computational Geometry
- 2000

1 Introduct ion The problem of computing a piecewise linear approximation to a surface from a set of sample points on the surface has been a focus of research in solid modeling and graphics due to… (More)

- Nina Amenta, Sunghee Choi, Ravi Krishna Kolluri
- Comput. Geom.
- 2001

The medial axis transform (or MAT) is a representation of an object as an in nite union of balls. We consider approximating the MAT of a three-dimensional object, and its complement, with a nite… (More)

- Nina Amenta, Sunghee Choi, Günter Rote
- Symposium on Computational Geometry
- 2003

Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns. We define a… (More)

- Jaehwan Ma, Sang Won Bae, Sunghee Choi
- The Visual Computer
- 2011

We present a novel method to approximate medial axis points given a set of points sampled from a surface and the normal vectors to the surface at those points. For each sample point, we find its… (More)

- Min-Joong Lee, Sunghee Choi, Chin-Wan Chung
- Inf. Sci.
- 2016

Betweenness centrality of a vertex (edge) in a graph is a measure for the relative participation of the vertex (edge) in the shortest paths in the graph. Betweenness centrality is widely used in… (More)

- Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa
- Comput. Geom.
- 2009

Article history: Received 21 February 2008 Accepted 24 February 2009 Available online 24 March 2009 Communicated by T. Asano

- Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa
- Algorithmica
- 2009

Given n points, called terminals, in the plane ℝ2 and a positive integer k, the bottleneck Steiner tree problem is to find k Steiner points from ℝ2 and a spanning tree on the n+k points that… (More)

- Sang Won Bae, Chunseok Lee, Sunghee Choi
- WALCOM
- 2009

We study the Euclidean bottleneck Steiner tree problem: given a set P of n points in the Euclidean plane, called terminals, find a Steiner tree with at most k Steiner points such that the length of… (More)

- Chunseok Lee, Donghoon Shin, Sang Won Bae, Sunghee Choi
- The 7th IEEE International Conference on Mobile…
- 2010

The best-case and the worst-case coverage were proposed originally for a single source and destination pair in a sensor network. In this paper, we propose a new coverage measure of the sensor network… (More)