Abstract is missing.
- Dudeney Dissections of Polygons and Polyhedrons - A SurveyJin Akiyama, Gisaku Nakamura. 1-30 [doi]
- Universal Measuring Devices without GradationsJin Akiyama, Hiroshi Fukuda, Gisaku Nakamura, Toshinori Sakai, Jorge Urrutia, Carlos Zamora-Cura. 31-40 [doi]
- A Note on the Purely Recursive Dissection for a Sequentially n-Divisible SquareJin Akiyama, Gisaku Nakamura, Akihiro Nozaki, Ken ichi Ozawa. 41-52 [doi]
- Sequentially Divisible Dissections of Simple PolygonsJin Akiyama, Toshinori Sakai, Jorge Urrutia. 53-66 [doi]
- Packing Convex Polygons into Rectangular BoxesHelmut Alt, Ferran Hurtado. 67-80 [doi]
- On the Number of Views of Polyhedral ScenesBoris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer. 81-90 [doi]
- Problems and Results around the Erdös-Szekeres Convex Polygon TheoremImre Bárány, Gyula Károlyi. 91-105 [doi]
- On Finding Maximum-Cardinality Symmetric SubsetsPeter Braß. 106-112 [doi]
- Folding and Unfolding Linkages, Paper, and PolyhedraErik D. Demaine. 113-124 [doi]
- On the Skeleton of the Metric PolytopeAntoine Deza, Komei Fukuda, Dmitrii V. Pasechnik, Masanori Sato. 125-136 [doi]
- Geometric Dissections that Swing and TwistGreg N. Frederickson. 137-148 [doi]
- On Convex Decompositions of PointsKiyoshi Hosono, David Rappaport, Masatsugu Urabe. 149-155 [doi]
- Volume Queries in PolyhedraJohn Iacono, Stefan Langerman. 156-159 [doi]
- Sum of Edge Lengths of a Graph Drawn on a Convex PolygonHiro Ito, Hideyuki Uehara, Mitsuo Yokoyama. 160-166 [doi]
- On Double Bound Graphs with Respect to Graph OperationsShin-ichi Iwai, Kenjiro Ogawa, Morimasa Tsuchiya. 167-175 [doi]
- Generalized Balanced Partitions of Two Sets of Points in the PlaneAtsushi Kaneko, Mikio Kano. 176-186 [doi]
- On Paths in a Complete Bipartite Geometric GraphAtsushi Kaneko, Mikio Kano. 187-191 [doi]
- Approximating Uniform Triangular Meshes for SpheresNaoki Katoh, Hiromichi Kojima, Ryo Taniguchi. 192-204 [doi]
- The Construction of Delaunay Diagrams by Lob ReductionPierre Kauffmann, Jean-Claude Spehner. 205-216 [doi]
- Geometric Transformations in Plane TriangulationsKen-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe. 217-221 [doi]
- Separation Sensitive Kinetic Separation Structures for Convex PolygonsDavid G. Kirkpatrick, Bettina Speckmann. 222-236 [doi]
- On Acute Triangulations of QuadrilateralsHiroshi Maehara. 237-243 [doi]
- Intersecting Red and Blue Line Segments in Optimal Time and PrecisionAndrea Mantler, Jack Snoeyink. 244-251 [doi]
- Tight Error Bounds of Geometric Problems on Convex Objects with Imprecise CoordinatesTakayuki Nagai, Nobuki Tokura. 252-263 [doi]
- Triangle Contact Systems, Orthogonal Plane Partitions, and their Hit GraphsAtsuhiro Nakamoto. 264-273 [doi]
- Note on Diagonal Flips and Chromatic Numbers of Quadrangulations on Closed SurfacesAtsuhiro Nakamoto, Seiya Negami. 274-279 [doi]
- An Extension of Cauchy s Arm Lemma with Application to Curve DevelopmentJoseph O Rourke. 280-291 [doi]
- On the Complexity of the Union of Geometric ObjectsJános Pach. 292-307 [doi]
- Structure Theorems for Systems of SegmentsJános Pach, József Solymosi. 308-317 [doi]
- 3-Dimensional Single Active Layer RoutingAndrás Recski, Dávid Szeszlér. 318-329 [doi]
- Nonregular Triangulations, View Graphs of Triangulations, and Linear Programming DualityFumihiko Takeuchi. 330-338 [doi]
- Efficient Algorithms for Searching a Polygonal Room with a DoorXuehou Tan. 339-350 [doi]
- A New Structure of Cylinder PackingYoshinori Teshima, Yoshinori Watanabe, Tohru Ogawa. 351-361 [doi]
- Efficient Algorithms for the Minimum Diameter Bridge ProblemTakeshi Tokuyama. 362-369 [doi]
- Illuminating Both Sides of Line SegmentsCsaba D. Tóth. 370-380 [doi]