The SCEAS System
Navigation Menu

Conferences in DBLP

Japanese Conference on Discrete and Computational Geometry (JCDCG) (jcdcg)
2002 (conf/jcdcg/2002)

  1. Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura
    Universal Measuring Devices with Rectangular Base. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:1-8 [Conf]
  2. Jin Akiyama, Rika Mochizuki, Nobuaki Mutoh, Gisaku Nakamura
    Maximin Distance for n Points in a Unit Square or a Unit Circle. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:9-13 [Conf]
  3. Jin Akiyama, Gisaku Nakamura
    Congruent Dudeney Dissections of Polygons: All the Hinge Points on Vertices of the Polygon. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:14-21 [Conf]
  4. Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia
    Playing with Triangulations. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:22-37 [Conf]
  5. Rebecca Alexander, Heather Dyson, Joseph O'Rourke
    The Foldings of a Square to Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:38-50 [Conf]
  6. David Avis
    On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:51-59 [Conf]
  7. Sergei Bespamyatnikh
    On Partitioning a Cake. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:60-71 [Conf]
  8. Sergei Bespamyatnikh, David G. Kirkpatrick
    Constrained Equitable 3-Cuttings. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:72-83 [Conf]
  9. Binay K. Bhattacharya, Asish Mukhopadhyay
    On the Minimum Perimeter Triangle Enclosing a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:84-96 [Conf]
  10. Prosenjit Bose, Luc Devroye, Pat Morin
    Succinct Data Structures for Approximating Convex Functions with Applications. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:97-107 [Conf]
  11. Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
    Efficient Algorithms for Constructing a Pyramid from a Terrain. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:108-117 [Conf]
  12. Antoine Deza, Komei Fukuda, Tomohiko Mizutani, Cong Vo
    On the Face Lattice of the Metric Polytope. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:118-128 [Conf]
  13. Ren Ding, Kiyoshi Hosono, Masatsugu Urabe, Changqing Xu
    Partitioning a Planar Point Set into Empty Convex Polygons. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:129-134 [Conf]
  14. Herbert Edelsbrunner, Alper Üngör
    Relaxed Scheduling in Dynamic Skin Triangulation. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:135-151 [Conf]
  15. Thomas Fevens
    A Note on Point Subsets with a Specified Number of Interior Points. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:152-158 [Conf]
  16. Greg N. Frederickson
    Piano-Hinged Dissections: Now Let's Fold! [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:159-171 [Conf]
  17. Mordecai J. Golin, Stefan Langerman, William L. Steiger
    The Convex Hull for Random Lines in the Plane. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:172-175 [Conf]
  18. Hiro Ito, Hiroshi Nagamochi
    Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:176-181 [Conf]
  19. Yoshiyuki Kusakari
    On Reconfiguring Radial Trees. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:182-191 [Conf]
  20. Yoichi Maeda
    Viewing Cube and Its Visual Angles. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:192-199 [Conf]
  21. Yoichi Maeda, Hiroshi Maehara
    Observing an Angle from Various Viewpoints. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:200-203 [Conf]
  22. Nobuaki Mutoh
    The Polyhedra of Maximal Volume Inscribed in the Unit Sphere and of Minimal Volume Circumscribed about the Unit Sphere. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:204-214 [Conf]
  23. Chie Nara, Toshinori Sakai, Jorge Urrutia
    Maximal Number of Edges in Geometric Graphs without Convex Polygons. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:215-220 [Conf]
  24. János Pach, Rados Radoicic, Géza Tóth
    Relaxing Planarity for Topological Graphs. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:221-232 [Conf]
  25. Rom Pinchasi
    On the Size of a Radial Set. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:233-245 [Conf]
  26. David Rappaport
    Tight Bounds for Visibility Matching of f-Equal Width Objects. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:246-250 [Conf]
  27. Toshinori Sakai
    Long Paths through Specified Vertices in 3-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:251-260 [Conf]
  28. Kazuhiro Suzuki
    On the Number of Intersections of Three Monochromatic Trees in the Plane. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:261-272 [Conf]
  29. Godfried T. Toussaint
    Open Problems in Geometric Methods for Instance-Based Learning. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:273-283 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002