C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
JCDCG
1998
2000
2003
2005
1998
2005
Keyphrases
Publications
volume 3742, 2005
Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers
JCDCG
3742 (2005)
2004
Jonathan Lenchner
Wedges in Euclidean Arrangements.
JCDCG
(2004)
Hiro Ito
Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon.
JCDCG
(2004)
Bernardo M. Ábrego
,
Esther M. Arkin
,
Silvia Fernández-Merchant
,
Ferran Hurtado
,
Mikio Kano
,
Joseph S. B. Mitchell
,
Jorge Urrutia
Matching Points with Circles and Squares.
JCDCG
(2004)
Marc Benkert
,
Alexander Wolff
,
Florian Widmann
The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation.
JCDCG
(2004)
Magdalene Grantson
,
Christos Levcopoulos
Tight Time Bounds for the Minimum Local Convex Partition Problem.
JCDCG
(2004)
Ileana Streinu
,
Walter Whiteley
Single-Vertex Origami and Spherical Expansive Motions.
JCDCG
(2004)
Ovidiu Daescu
,
Ningfang Mi
,
Chan-Su Shin
,
Alexander Wolff
Farthest-Point Queries with Geometric and Combinatorial Constraints.
JCDCG
(2004)
Magdalene Grantson
,
Christos Levcopoulos
A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem.
JCDCG
(2004)
Sergey Bereg
-Dimensional Rigidity Matroid of Sparse Graphs.
JCDCG
(2004)
Yoichi Maeda
Visual Pascal Configuration and Quartic Surface.
JCDCG
(2004)
Joachim Gudmundsson
,
Jan Vahrenhold
I/O-Efficiently Pruning Dense Spanners.
JCDCG
(2004)
Gábor Tardos
,
Géza Tóth
Crossing Stars in Topological Graphs.
JCDCG
(2004)
Erik D. Demaine
,
John Iacono
,
Stefan Langerman
Grid Vertex-Unfolding Orthostacks.
JCDCG
(2004)
Kiyoshi Hosono
,
Masatsugu Urabe
On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons.
JCDCG
(2004)
Xuehou Tan
An Optimal Algorithm for the 1-Searchability of Polygonal Rooms.
JCDCG
(2004)
Hervé Brönnimann
Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane.
JCDCG
(2004)
Prosenjit Bose
,
Stefan Langerman
Weighted Ham-Sandwich Cuts.
JCDCG
(2004)
Jirí Matousek
Nonexistence of 2-Reptile Simplices.
JCDCG
(2004)
Godfried T. Toussaint
The Geometry of Musical Rhythm.
JCDCG
(2004)
Sergey Bereg
,
Adrian Dumitrescu
,
János Pach
Sliding Disks in the Plane.
JCDCG
(2004)
volume 2866, 2003
Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers
JCDCG
2866 (2003)
2002
Sergei Bespamyatnikh
On Partitioning a Cake.
JCDCG
(2002)
Jin Akiyama
,
Hiroshi Fukuda
,
Gisaku Nakamura
Universal Measuring Devices with Rectangular Base.
JCDCG
(2002)
Chie Nara
,
Toshinori Sakai
,
Jorge Urrutia
Maximal Number of Edges in Geometric Graphs without Convex Polygons.
JCDCG
(2002)
Rom Pinchasi
On the Size of a Radial Set.
JCDCG
(2002)
David Rappaport
Tight Bounds for Visibility Matching of f-Equal Width Objects.
JCDCG
(2002)
Godfried T. Toussaint
Open Problems in Geometric Methods for Instance-Based Learning.
JCDCG
(2002)
Rebecca Alexander
,
Heather Dyson
,
Joseph O'Rourke
The Foldings of a Square to Convex Polyhedra.
JCDCG
(2002)
Yoichi Maeda
Viewing Cube and Its Visual Angles.
JCDCG
(2002)
Antoine Deza
,
Komei Fukuda
,
Tomohiko Mizutani
,
Cong Vo
On the Face Lattice of the Metric Polytope.
JCDCG
(2002)
Jin Akiyama
,
Rika Mochizuki
,
Nobuaki Mutoh
,
Gisaku Nakamura
Maximin Distance for n Points in a Unit Square or a Unit Circle.
JCDCG
(2002)
Mordecai J. Golin
,
Stefan Langerman
,
William L. Steiger
The Convex Hull for Random Lines in the Plane.
JCDCG
(2002)
David Avis
On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities.
JCDCG
(2002)
Greg N. Frederickson
Piano-Hinged Dissections: Now Let's Fold!
JCDCG
(2002)
Thomas Fevens
A Note on Point Subsets with a Specified Number of Interior Points.
JCDCG
(2002)
Binay K. Bhattacharya
,
Asish Mukhopadhyay
On the Minimum Perimeter Triangle Enclosing a Convex Polygon.
JCDCG
(2002)
Herbert Edelsbrunner
,
Alper Üngör
Relaxed Scheduling in Dynamic Skin Triangulation.
JCDCG
(2002)
Hiro Ito
,
Hiroshi Nagamochi
Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon.
JCDCG
(2002)
Prosenjit Bose
,
Luc Devroye
,
Pat Morin
Succinct Data Structures for Approximating Convex Functions with Applications.
JCDCG
(2002)
Yoichi Maeda
,
Hiroshi Maehara
Observing an Angle from Various Viewpoints.
JCDCG
(2002)
Nobuaki Mutoh
The Polyhedra of Maximal Volume Inscribed in the Unit Sphere and of Minimal Volume Circumscribed about the Unit Sphere.
JCDCG
(2002)
Jinhee Chun
,
Kunihiko Sadakane
,
Takeshi Tokuyama
Efficient Algorithms for Constructing a Pyramid from a Terrain.
JCDCG
(2002)
Yoshiyuki Kusakari
On Reconfiguring Radial Trees.
JCDCG
(2002)
Toshinori Sakai
Long Paths through Specified Vertices in 3-Connected Graphs.
JCDCG
(2002)
Ren Ding
,
Kiyoshi Hosono
,
Masatsugu Urabe
,
Changqing Xu
Partitioning a Planar Point Set into Empty Convex Polygons.
JCDCG
(2002)
János Pach
,
Rados Radoicic
,
Géza Tóth
Relaxing Planarity for Topological Graphs.
JCDCG
(2002)
Oswin Aichholzer
,
David Bremner
,
Erik D. Demaine
,
Ferran Hurtado
,
Evangelos Kranakis
,
Hannes Krasser
,
Suneeta Ramaswami
,
Saurabh Sethia
,
Jorge Urrutia
Playing with Triangulations.
JCDCG
(2002)
Kazuhiro Suzuki
On the Number of Intersections of Three Monochromatic Trees in the Plane.
JCDCG
(2002)
Jin Akiyama
,
Gisaku Nakamura
Congruent Dudeney Dissections of Polygons: All the Hinge Points on Vertices of the Polygon.
JCDCG
(2002)