Skip to main content

Varol Akman

1991

  • Varol Akman, A. Arslan, W. Randolph Franklin, and P. J. W. ten Hagen. Implementing a topological picturebook. In Proc. 13th IMACS World Congress on Computation and Applied Maths. Dublin, 1991.
    [details] [BibTeX▼]

1990

  • Varol Akman, D. Ede, W. Randolph Franklin, and P. J. W. ten Hagen. Mental models of force and motion. In Okyay Kaynak, editor, Proc. IEEE International Workshop on Intelligent Motion Control, volume 1, 153–158. Bogazici University, Istanbul, 20-22 August 1990. IEEE Press. Catalog No. 90TH0272-5.
    [details] [BibTeX▼]
  • Wm Randolph Franklin, Narayanaswami Chandrasekhar, Mohan Kankanhalli, Varol Akman, and Peter YF Wu. Efficient geometric operations for CAD. In Michael J. Wozny, Joshua U. Turner, and K. Preiss, editors, Geometric Modeling for Product Engineering, pages 485–498. Elsevier Science Publishers B.V. (North-Holland), 1990.
    [details] [full text] [BibTeX▼]

1989

  • Varol Akman and Wm Randolph Franklin. Representing objects as rays, or how to pile up an octree? Computers and Graphics, 13(3):373–379, 1989.
    [details] [full text] [BibTeX▼]
  • Varol Akman and Wm Randolph Franklin. Ray representation for k-d trees. Pattern Recognition Letters, pages 315–320, November 1989.
    [details] [full text] [BibTeX▼]
  • Wm Randolph Franklin, Mohan Kankanhalli, Chandrasekhar Narayanaswami, and Varol Akman. Efficient intersection calculations in large databases. In International Cartographic Association 14th World Conference, A–62 – A–63. Budapest, August 1989.
    [details] [full text] [BibTeX▼]
  • Varol Akman, Wm Randolph Franklin, Mohan Kankanhalli, and Chandrasekhar Narayanaswami. Geometric computing and the uniform grid data technique. Computer Aided Design, 21(7):410–420, 1989.
    [details] [full text] [BibTeX▼]
  • Varol Akman, W. Randolph Franklin, and B. Veth. Design systems with common sense. In PJW ten Hagen and P. Veerkamp, editors, Proceedings of the Third Eurographics Workshop on Intelligent CAD Systems: Practical Experience and Evaluation, 317–322. Texel, the Netherlands, 3-7 Apr 1989. Springer–Verlag.
    [details] [BibTeX▼]

1988

  • Wm Randolph Franklin and Varol Akman. Adaptive grid for polyhedral visibility in object space, an implementation. Computer Journal, 31(1):56–60, February 1988.
    [details] [full text] [BibTeX▼]
  • Wm Randolph Franklin, Narayanaswami Chandrasekhar., Mohan Kankanhalli, Manoj Seshan, and Varol Akman. Efficiency of uniform grids for intersection detection on serial and parallel machines. In Nadia Magnenat-Thalmann and D. Thalmann, editors, New Trends in Computer Graphics (Proc. Computer Graphics International'88), pages 288–297. Springer-Verlag, 1988.
    [details] [full text] [BibTeX▼]
  • WR Franklin, N. Chandrasekhar, M. Kankanhalli, and V. Akman. Fast intersection detection on serial and parallel machines using the uniform grid technique. 1988.
    [details] [full text] [BibTeX▼]

1987

  • Wm Randolph Franklin and V. Akman. A workbench to compute unobstructed shortest paths in three-space. In Proc. 1st Internat. Conf. Indust. Applied Math., 1–38. Paris, France, 1987.
    [details] [full text] [BibTeX▼]
  • Wm Randolph Franklin and Varol Akman. A simple and efficient haloed line algorithm for hidden line elimination. Computer Graphics Forum, 6(2):103–109, May 1987.
    [details] [full text] [BibTeX▼]
  • Varol Akman. Unobstructed Shortest Paths in Polyhedral Environments. Number 251 in Lecture Notes in Computer Science. Springer-Verlag, 1987.
    [details] [BibTeX▼]

1986

  • Varol Akman and W. Randolph Franklin. Locus techniques for shortest path problems in robotics. In IFAC Symposium on Robot Control (SYSROCO'85). Barcelona, 1986.
    [details] [full text] [BibTeX▼]
  • Varol Akman and Wm Randolph Franklin. On the question `is $\sum _1^n \sqrt a_i\le L ?$'. EATCS Bulletin, pages 16–20, February 1986.
    [details] [full text] [BibTeX▼]
  • Wm Randolph Franklin and Varol Akman. Reconstructing visible regions from visible segments. BIT, 26:430–441, 1986.
    [details] [full text] [BibTeX▼]

1985

  • Wm Randolph Franklin and Varol Akman. Shortest paths in 3-space, Voronoi diagrams with barriers, and related complexity and algebraic issues. In Proceedings of the NATO Advanced Study Institute on Fundamental Algorithms for Computer Graphics, volume 17 of NATO ASI Series F, pages 895–917. Springer-Verlag, Ilkley, Yorkshire, England, 30 March – 12 April 1985.
    [details] [full text] [BibTeX▼]
  • Wm Randolph Franklin and Varol Akman. Building an octree from a set of parallelepipeds. IEEE Computer Graphics and Applications, 5(10):58–64, October 1985.
    [details] [full text] [BibTeX▼]
  • Wm Randolph Franklin and Varol Akman. Octree data structures and creation by stacking. In Nadia Magenat-Thalmann, editor, Computer Generated Images, State of the Art. Springer-Verlag, 1985.
    [details] [full text] [BibTeX▼]
  • Wm Randolph Franklin, Varol Akman, and Colin Verrilli. Voronoi diagrams with barriers and on polyhedra for minimal path planning. Visual Comput., 1(2):133–150, October 1985.
    [details] [full text] [BibTeX▼]
  • Wm Randolph Franklin and Varol Akman. Building an octree from a set of parallelepipeds. In Graphics Interface. 1985.
    [details] [full text] [BibTeX▼]
  • Varol Akman and W. Randolph Franklin. Partitioning the space to calculate shortest paths to any goal around polyhedral obstacles. In Proceedings of ROBEXS'85, the First Annual Workshop on Robotics and Expert Systems. NASA/Johnson Space Center, 27–28 June 1985.
    [details] [full text] [BibTeX▼]
  • Varol Akman. Shortest paths avoiding polyhedral obstacles in 3-dimensional euclidean space. PhD thesis, Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute, 1985. UMI abstract no. 85-28,651.
    [details] [BibTeX▼]

1984

  • Wm Randolph Franklin and Varol Akman. Shortest paths between source and goal points located on/around a convex polyhedron. In 22nd Annual Allerton Conference on Communication, Control, and Computing. Urbana, Illinois, USA, 3–5 October 1984.
    [details] [full text] [BibTeX▼]