Otfried Cheong | Academic Influence

Otfried Cheong's AcademicInfluence.com Rankings

Otfried Cheong

Computer Science

#3143

World Rank

#3294

Historical Rank

Database

#8991

World Rank

#9453

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Otfried Cheong's Degrees

Bachelors Computer Science Seoul National University

Similar Degrees You Can Earn

Why Is Otfried Cheong Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Otfried Cheong is a German computational geometer working in South Korea at KAIST. He is known as one of the authors of the widely used computational geometry textbook Computational Geometry: Algorithms and Applications and as the developer of Ipe, a vector graphics editor.

(See a Problem?)

Otfried Cheong's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Computational geometry: algorithms and applications, 3rd Edition (2000) (573)
Euclidean minimum spanning trees and bichromatic closest pairs (1990) (191)
Constructing levels in arrangements and higher order Voronoi diagrams (1994) (140)
Linear optimization queries (1992) (132)
Competitive facility location: the Voronoi game (2004) (117)
The Voronoi Diagram of Curved Objects (1995) (101)
The overlay of lower envelopes and its applications (1996) (94)
Finding a Guard that Sees Most and a Shop that Sells Most (2004) (83)
On lazy randomized incremental construction (1994) (79)
The One-Round Voronoi Game (2002) (76)
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams (1991) (75)
Computing the Maximum Overlap of Two Convex Polygons under Translations (1996) (65)
Computing and verifying depth orders (1992) (64)
Ray shooting in convex polytopes (1992) (63)
Cuttings and applications (1995) (60)
Computing many faces in arrangements of lines and segments (1994) (59)
Separating an object from its cast (1997) (51)
On simplifying dot maps (2004) (50)
On ray shooting in convex polytopes (1993) (49)
Farthest-polygon Voronoi diagrams (2007) (47)
Area-preserving approximations of polygonal paths (2006) (42)
Voronoi diagrams on the spher (2002) (41)
Sparse geometric graphs with small dilation (2005) (39)
On the Number of Edges of Fan-Crossing Free Graphs (2013) (38)
Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points (2000) (37)
Dynamic Maintenance of Geometric Structures Made Easy (1991) (34)
A deterministic algorithm for the three-dimensional diameter problem (1993) (34)
Measuring the Similarity of Geometric Graphs (2009) (33)
Helly-Type Theorems for Line Transversals to Disjoint Unit Balls (2006) (32)
Geometric permutations of disjoint unit spheres (2005) (32)
Competitive Facility Location along a Highway (2001) (30)
Range Searching in Low-Density Environments (1996) (30)
Computing a minimum-dilation spanning tree is NP-hard (2007) (29)
Hadwiger and Helly-type theorems for disjoint unit spheres in R3 (2005) (28)
Approximation of Convex Figures by Pairs of Rectangles (1990) (27)
Maximizing the overlap of two planar convex sets under rigid motions (2005) (25)
Immobilizing polygons against a wall (1995) (23)
Finding largest rectangles in convex polygons (2014) (23)
Aligning Two Convex Figures to Minimize Area or Perimeter (2012) (20)
Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons (2004) (19)
Proceedings of the twenty-second annual symposium on Computational geometry (2006) (19)
Constructing Optimal Highways (2007) (19)
Reachability by Paths of Bounded Curvature in a Convex Polygon (2010) (17)
Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces and its applications (1996) (17)
Computing farthest neighbors on a convex polytope (2001) (17)
The cost of bounded curvature (2011) (15)
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets (2006) (15)
Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces (1997) (15)
The extensible drawing editor Ipe (1995) (14)
Reachability by paths of bounded curvature in convex polygons (2000) (14)
The complexity of flow on fat terrains and its i/o-efficient computation (2010) (13)
The overlay of lower envelopes in three dimensions and its applications (1995) (13)
Reaching a Goal with Directional Uncertainty (1993) (12)
Piecewise linear paths among convex obstacles (1993) (12)
Casting a polyhedron with directional uncertainty (2002) (11)
Spanning Trees Crossing Few Barriers (1999) (11)
Disjoint Unit Spheres admit at Most Two Line Transversals (2003) (11)
Optimal spanners for axis-aligned rectangles (2005) (10)
Dynamic maintenance of convex polytopes and related structures (1992) (10)
Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons (1999) (9)
Lower bounds to helly numbers of line transversals to disjoint congruent balls (2012) (9)
Reverse Nearest Neighbor Queries in Fixed Dimension (2009) (9)
Aperture-angle and Hausdorff-approximation of convex figures (2007) (8)
Weight Balancing on Boundaries and Skeletons (2014) (8)
Parallel Computation of Discrete Voronoi Diagrams (Extended Abstract) (1989) (7)
Shortcuts for the Circle (2016) (7)
Stacking and Bundling Two Convex Polygons (2005) (6)
I/O-Efficient Flow Modeling on Fat Terrains (2007) (6)
Computation of Non-dominated Points Using Compact Voronoi Diagrams (2010) (6)
A Generalization of the Convex Kakeya Problem (2012) (5)
Lines Pinning Lines (2010) (5)
Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon (2004) (5)
Set systems and families of permutations with small traces (2009) (5)
A fast algorithm for data collection along a fixed track (2014) (5)
The Hadwiger Number of Jordan Regions Is Unbounded (2007) (5)
Computing Convolutions on Mesh-Like Structures (1993) (5)
Reaching a Polygon with Directional Uncertainty (2001) (5)
Bounds on the Size of Merging Networks (1995) (5)
Covering many points with a small-area box (2016) (5)
Minimum Convex Container of Two Convex Polytopes under Translations (2018) (5)
The visibility region of points in a simple polygon (1999) (4)
Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings (2009) (4)
Aperture-Angle and Hausdorff-Approximation of Convex Figures (2008) (4)
Packing 2D Disks into a 3D Container (2018) (4)
Point Location in Zones of K-flats in Arrangements (1996) (4)
A note on the perimeter of fat objects (2011) (4)
Computing a Single Cell in the Overlay of Two Simple Polygons (1997) (4)
Lower Bounds for Pinning Lines by Balls (2009) (3)
The reflex-free hull (2004) (3)
Finding Largest Common Point Sets (2017) (3)
Motion Planning for Vacuum Cleaner Robots (1994) (3)
Casting with Skewed Ejection Direction (1998) (3)
Parabola Separation Queries and their Application to Stone Throwing (2007) (3)
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions (2015) (3)
The reverse Kakeya problem (2018) (3)
Randomization and derandomization (2004) (3)
Throwing Stones Inside Simple Polygons (2006) (3)
Geometric permutations of non-overlapping unit balls revisited (2014) (2)
Computation of spatial skyline points (2009) (2)
Separating and Shattering Long Line Segments (1996) (2)
Lower Bounds for Pinning Lines by Balls (Extended Abstract) (2009) (2)
Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties (2016) (2)
Smallest universal covers for families of triangles (2021) (2)
Building bridges between convex regions (2001) (2)
Fitting a Graph to One-Dimensional Data (2018) (1)
Single-Source Dilation-Bounded Minimum Spanning Trees (2012) (1)
Computational Geometry (Dagstuhl Seminar 17171) (2017) (1)
44 RANDOMIZATION AND DERANDOMIZATION (2016) (0)
Theory and Applications of Geometric Optimization (NII Shonan Meeting 2016-9) (2016) (0)
Aligning Two Convex Figures to Minimize Area or Perimeter (2010) (0)
Computational Geometry (Dagstuhl Seminar 15111) (2015) (0)
The Harmony of Spheres (2007) (0)
River networks and watershed maps of triangulated terrains revisited (2006) (0)
Lower bounds to helly numbers of line transversals to disjoint congruent balls (2011) (0)
On Finding Non-dominated Points using Compact Voronoi Diagrams (2009) (0)
Casting with skewed ejection direction revisited (1999) (0)
The inverse Kakeya problem (2019) (0)
A New Geometric Proof on Shortest Paths of Bounded Curvature (2005) (0)
Covering families of triangles (2023) (0)
Computational Geometry (Dagstuhl Seminar 13101) (2013) (0)
The Topology of the set of line Transversals (2022) (0)
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, Clear Water Bay, Hong Kong, China, June 12-14, 2000 (2000) (0)
Weight balancing on boundaries (2015) (0)
28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand (2017) (0)
Lines pinning lines (Computational Geometry and Discrete Mathematics) (2009) (0)
Computational Geometry Third Edition (2020) (0)
Spanning Trees Crossing Few Barriers (Algorithm Engineering as a New Paradigm) (1999) (0)
Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006 (2006) (0)
Building bridges between convex region (2003) (0)
Algorithms and computation : 21st international symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010 : proceedings (2010) (0)
HKUST Institutional Repository (2003) (0)
Parallel computation of disease transforms (2005) (0)
Placing your Coins on a Shelf (2017) (0)
On the perimeter of fat objects (2010) (0)
No weak epsilon nets for lines and convex sets in space (2022) (0)
The inverse Kakeya problem (2021) (0)
The thickness of fan-planar graphs is at most three (2022) (0)
Parallel Computation of Distance Transforms - Erratum (1992) (0)
On the Number of Edges of Fan-Crossing Free Graphs (2014) (0)
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions (2016) (0)
A Generalization of the Convex Kakeya Problem (2013) (0)
Line Transversals and Pinning Numbers (2009) (0)
On Simplifying Dot Maps ( abstract ) (0)

This paper list is powered by the following services:

Other Resources About Otfried Cheong

en.wikipedia.org

What Schools Are Affiliated With Otfried Cheong?

Otfried Cheong is affiliated with the following schools: