Gon (ゴン) is a Japan-exclusive side-scrolling action video game with platforming elements for the Super Famicom published by Bandai. The game is an… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

List of Papers This thesis is based on the following papers, which are referred to in the text by their Roman numerals. Serial… (More)

Is this relevant?

2011

2011

- Grace I. Lin, Marilyn A. Walker
- AIIDE
- 2011

Many forms of interactive digital entertainment involve interacting with virtual dramatic characters. Our long term goal is to… (More)

Is this relevant?

2007

2007

- Nathaniel D. Blair-Stahn, David Wilson
- 2007

Consider a unit-resistive plate in the shape of a regular polygon with 2n sides, in which even-numbered sides are wired to… (More)

Is this relevant?

2007

2007

- Edward Yu-Te Shen, Henry Lieberman, Francis Lam
- IUI
- 2007

Electronic Commerce on the Web is thriving, but consumers still have trouble finding products that will meet their needs and… (More)

Is this relevant?

2006

2006

Introduction Let P = p1, . . . , pn be a simple polygon (all polygons are assumed convex throughout this paper). A fundamental… (More)

Is this relevant?

2006

2006

- Zhenming Chen, Evanthia Papadopoulou, Jinhui Xu
- Inf. Process. Lett.
- 2006

In this paper, we present a plane sweep algorithm for constructing the Voronoi diagram of a set of non-crossing line segments in… (More)

Is this relevant?

2001

2001

MacMahon devoted a significant portion of Volume II of his famous book “Combinatory Analysis” to the introduction of Partition… (More)

Is this relevant?

1998

1998

- Fan Chung Graham, Ronald L. Graham
- Discrete & Computational Geometry
- 1998

In a seminal paper from 1935, Erd}os and Szekeres showed that for each n there exists a least value g(n) such that any subset of… (More)

Is this relevant?

1992

1992

- David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger
- Discrete & Computational Geometry
- 1992

Given a set P of n points in the plane and a number k, we want to find a polygon ~ with vertices in P of minimum area that… (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Guy Bouchitté
- SIAM Review
- 1991

sequently, three ofthem are in one ofthe holes. These three points form a triangle of area not exceeding . But nine are too many… (More)

Is this relevant?