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▼]

  @inproceedings{akman-dublin,
      author = "Akman, Varol and Arslan, A. and Franklin, W. Randolph and ten {H}agen, P. J. W.",
      title = "Implementing a Topological Picturebook",
      booktitle = "Proc. 13th IMACS World Congress on Computation and Applied Maths",
      year = "1991",
      address = "Dublin",
      mykey = "akman"
  }
  

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▼]

  @inproceedings{akman-mental,
      author = "Akman, Varol and Ede, D. and Franklin, W. Randolph and ten {H}agen, P. J. W.",
      Editor = "Kaynak, Okyay",
      title = "Mental Models of Force and Motion",
      booktitle = "Proc. {IEEE} International Workshop on Intelligent Motion Control",
      Address = "Bogazici University, Istanbul",
      volume = "1",
      year = "1990",
      Month = "20-22 August",
      pages = "153--158",
      Publisher = "IEEE Press. Catalog No. 90TH0272-5",
      mykey = "akman"
  }
  

• 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▼]

  @incollection{fckaw-egoc-90,
      author = "Franklin, Wm Randolph and Chandrasekhar, Narayanaswami and Kankanhalli, Mohan and Akman, Varol and Wu, Peter YF",
      editor = "Wozny, Michael J. and Turner, Joshua U. and Preiss, K.",
      title = "Efficient Geometric Operations for {CAD}",
      booktitle = "Geometric Modeling for Product Engineering",
      publisher = "Elsevier Science Publishers B.V. (North-Holland)",
      year = "1990",
      note = "Selected and expanded papers from the IFIP WG 5.2/NSF Working Conference on Geometric Modeling, Rensselaerville, USA, 18-22 September 1988",
      pages = "485--498",
      href = "\bibhref{58-wozny90-efficient}",
      mykey = "topology chandra akman kankanhalli",
      keywords = "intersection, CAD, grids"
  }
  

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▼]

  @article{af-rorhp-89,
      author = "Akman, Varol and Franklin, Wm Randolph",
      title = "Representing Objects as Rays, or How to Pile up an Octree?",
      journal = "Computers and Graphics",
      volume = "13",
      number = "3",
      year = "1989",
      pages = "373--379",
      href = "\bibhref{64-cg89-rays}",
      mykey = "akman",
      keywords = "oct trees, measure, polyhedra, rays"
  }
  

• Varol Akman and Wm Randolph Franklin. Ray representation for k-d trees. Pattern Recognition Letters, pages 315–320, November 1989.
  [details] [full text] [BibTeX▼]

  @article{af-rrkt-89,
      author = "Akman, Varol and Franklin, Wm Randolph",
      title = "Ray Representation for K-d Trees",
      journal = "Pattern Recognition Letters",
      month = "November",
      year = "1989",
      pages = "315--320",
      href = "\bibhref{66-prl89-ray}",
      mykey = "akman",
      keywords = "oct trees, measure, rays"
  }
  

• 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▼]

  @inproceedings{f-eiclb-89,
      author = "Franklin, Wm Randolph and Kankanhalli, Mohan and Narayanaswami, Chandrasekhar and Akman, Varol",
      title = "Efficient Intersection Calculations in Large Databases",
      booktitle = "International Cartographic Association 14th World Conference",
      address = "Budapest",
      month = "August",
      year = "1989",
      pages = "A-62 -- A-63",
      href = "\bibhref{60-budapest89-efficient}",
      mykey = "akman chandra kankanhalli",
      keywords = "intersection, grids"
  }
  

• 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▼]

  @article{afkn-gcugd-89,
      author = "Akman, Varol and Franklin, Wm Randolph and Kankanhalli, Mohan and Narayanaswami, Chandrasekhar",
      title = "Geometric Computing and the Uniform Grid Data Technique",
      journal = "Computer Aided Design",
      year = "1989",
      volume = "21",
      number = "7",
      pages = "410--420",
      href = "\bibhref{54-cad89-ug}",
      mykey = "akman chandra kankanhalli",
      keywords = "intersection, CAD, grids"
  }
  

• 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▼]

  @inproceedings{akman-design-89,
      author = "Akman, Varol and Franklin, W. Randolph and Veth, B.",
      editor = "ten Hagen, PJW and Veerkamp, P.",
      title = "Design Systems with Common Sense",
      booktitle = "Proceedings of the Third Eurographics Workshop on Intelligent CAD Systems: Practical Experience and Evaluation",
      month = "3-7 Apr",
      year = "1989",
      pages = "317--322",
      address = "Texel, the Netherlands",
      publisher = "Springer--Verlag",
      mykey = "akman"
  }
  

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▼]

  @article{fa-agpvo-88-in-geom,
      author = "Franklin, Wm Randolph and Akman, Varol",
      title = "Adaptive Grid for polyhedral visibility in object space, an implementation",
      journal = "Computer Journal",
      volume = "31",
      number = "1",
      pages = "56-60",
      month = "February",
      year = "1988",
      href = "\bibhref{43-cj88-polyvis}",
      mykey = "akman vis3dobj",
      keywords = "computer graphics, hidden line/surface elimination"
  }
  

• 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▼]

  @incollection{fcksa-eugid-88,
      author = "Franklin, Wm Randolph and Chandrasekhar., Narayanaswami and Kankanhalli, Mohan and Seshan, Manoj and Akman, Varol",
      editor = "Magnenat-Thalmann, Nadia and Thalmann, D.",
      title = "Efficiency of uniform grids for intersection detection on serial and parallel machines",
      booktitle = "New Trends in Computer Graphics (Proc. Computer Graphics International'88)",
      publisher = "Springer-Verlag",
      year = "1988",
      pages = "288--297",
      href = "\bibhref{50-gi88-ug}",
      mykey = "akman chandra kankanhalli",
      keywords = "parallel computation, intersection, grids"
  }
  

• 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▼]

  @unpublished{fcka-fidspm-88,
      author = "Franklin, WR and Chandrasekhar, N. and Kankanhalli, M. and Akman, V.",
      title = "Fast intersection detection on serial and parallel machines using the uniform grid technique",
      year = "1988",
      note = "",
      href = "\bibhref{53-unpub88-fast}",
      mykey = "akman kankanhalli chandra"
  }
  

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▼]

  @inproceedings{fa-wcusp-87,
      author = "Franklin, Wm Randolph and Akman, V.",
      title = "A workbench to compute unobstructed shortest paths in three-space",
      booktitle = "Proc. 1st Internat. Conf. Indust. Applied Math.",
      address = "Paris, France",
      year = "1987",
      pages = "1--38",
      oldlabel = "geom-1319",
      href = "\bibhref{36-siam87-shortest}",
      mykey = "akman pathplan",
      keywords = "motion planning"
  }
  

• 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▼]

  @article{fa-sehla-87,
      author = "Franklin, Wm Randolph and Akman, Varol",
      title = "A simple and efficient haloed line algorithm for hidden line elimination",
      journal = "Computer Graphics Forum",
      volume = "6",
      number = "2",
      pages = "103-109",
      month = "May",
      year = "1987",
      href = "\bibhref{42-cgf87-haloed}",
      mykey = "akman vis3dobj",
      keywords = "computer graphics, hidden line/surface elimination"
  }
  

• Varol Akman. Unobstructed Shortest Paths in Polyhedral Environments. Number 251 in Lecture Notes in Computer Science. Springer-Verlag, 1987.
  [details] [BibTeX▼]

  @book{akman-sv,
      Author = "Akman, Varol",
      Title = "Unobstructed Shortest Paths in Polyhedral Environments",
      Series = "Lecture Notes in Computer Science",
      Publisher = "Springer-Verlag",
      Number = "251",
      Year = "1987",
      mykey = "akman",
      Wrfnote = "WRF has"
  }
  

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▼]

  @incollection{akman-barcelona-86,
      author = "Akman, Varol and Franklin, W. Randolph",
      title = "Locus Techniques for Shortest Path Problems in Robotics",
      booktitle = "IFAC Symposium on Robot Control (SYSROCO'85)",
      address = "Barcelona",
      year = "1986",
      href = "\bibhref{35-sysroco85-locus}",
      mykey = "akman pathplan"
  }
  

• 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▼]

  @article{af-oqiss-86,
      author = "Akman, Varol and Franklin, Wm Randolph",
      title = "On the Question `Is {$\sum\_1^n \sqrt{a\_i}\le L ?$}'",
      journal = "EATCS Bulletin",
      number = "28",
      month = "February",
      year = "1986",
      pages = "16--20",
      href = "\bibhref{38-eatcs86-question}",
      mykey = "akman",
      keywords = "motion planning"
  }
  

• Wm Randolph Franklin and Varol Akman. Reconstructing visible regions from visible segments. BIT, 26:430–441, 1986.
  [details] [full text] [BibTeX▼]

  @article{fa-rvrvs-86,
      author = "Franklin, Wm Randolph and Akman, Varol",
      title = "Reconstructing Visible Regions From Visible Segments",
      journal = "BIT",
      volume = "26",
      pages = "430--441",
      year = "1986",
      href = "\bibhref{30-bit86-reconstruct}",
      mykey = "akman",
      keywords = "computer graphics, hidden line/surface elimination"
  }
  

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▼]

  @incollection{fa-sp3sv-85,
      author = "Franklin, Wm Randolph and Akman, Varol",
      title = "Shortest Paths in 3-Space, {V}oronoi Diagrams with Barriers, and Related Complexity and Algebraic Issues",
      booktitle = "Proceedings of the {NATO} Advanced Study Institute on Fundamental Algorithms for Computer Graphics",
      address = "Ilkley, Yorkshire, England",
      month = "30 March -- 12 April",
      year = "1985",
      publisher = "Springer-Verlag",
      series = "{NATO} {ASI} Series F",
      volume = "17",
      pages = "895--917",
      href = "\bibhref{31-nato85-shortest}",
      mykey = "akman pathplan",
      keywords = "motion planning"
  }
  

• Wm Randolph Franklin and Varol Akman. Shortest paths in 3-space, Voronoi diagrams with barriers, and related complexity and algebraic issues. In L. Basañez, Gabriel A. Ferraté, and George N. Saridis, editors, Robot Control (SYROCO '85): Proceedings of the 1st IFAC Symposium, volume 1, pages 271–275. International Federation of Automatic Control, Barcelona, Spain, 6–8 November 1985.
  [details] [BibTeX▼]

  @incollection{fa-sp3sv-85a,
      author = "Franklin, Wm Randolph and Akman, Varol",
      editor = "Basañez, L. and Ferraté, Gabriel A. and Saridis, George N.",
      title = "Shortest Paths in 3-Space, {V}oronoi Diagrams with Barriers, and Related Complexity and Algebraic Issues",
      booktitle = "Robot Control ({SYROCO} '85): Proceedings of the 1st {IFAC} Symposium",
      address = "Barcelona, Spain",
      month = "6--8 November",
      year = "1985",
      volume = "1",
      publisher = "International Federation of Automatic Control",
      isbn = "0080334466, 9780080334462",
      pages = "271--275",
      xfulltext = "https://wrfranklin.org/p/31-nato85-shortest.pdf",
      xhref = "\bibhref{31-nato85-shortest}",
      mykey = "akman pathplan",
      keywords = "motion planning"
  }
  

• 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▼]

  @article{fa-bospj-85,
      author = "Franklin, Wm Randolph and Akman, Varol",
      title = "Building an Octree from a Set of Parallelepipeds",
      journal = "IEEE Computer Graphics and Applications",
      month = "October",
      year = "1985",
      volume = "5",
      number = "10",
      pages = "58-64",
      href = "\bibhref{40-cga85-octree}",
      mykey = "akman",
      succeeds = "fa-bospi-85",
      keywords = "computer graphics, oct trees"
  }
  

• 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▼]

  @incollection{fa-odscs-85,
      author = "Franklin, Wm Randolph and Akman, Varol",
      editor = "Magenat-Thalmann, Nadia",
      title = "Octree Data Structures and Creation by Stacking",
      booktitle = "Computer Generated Images, State of the Art",
      publisher = "Springer-Verlag",
      year = "1985",
      href = "\bibhref{39-cgi85-octree-stack}",
      mykey = "akman",
      keywords = "computer graphics, oct trees"
  }
  

• 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▼]

  @article{fav-vdbpm-85,
      author = "Franklin, Wm Randolph and Akman, Varol and Verrilli, Colin",
      title = "Voronoi diagrams with barriers and on polyhedra for minimal path planning",
      journal = "Visual Comput.",
      volume = "1",
      number = "2",
      month = "October",
      year = "1985",
      pages = "133--150",
      oldlabel = "geom-1246",
      href = "\bibhref{18-vc85-voronoi}",
      mykey = "akman pathplan",
      keywords = "robotics, planar partitions, motion planning, Voronoi diagrams"
  }
  

• Wm Randolph Franklin and Varol Akman. Building an octree from a set of parallelepipeds. In Graphics Interface. 1985.
  [details] [full text] [BibTeX▼]

  @inproceedings{fa-bospi-85,
      author = "Franklin, Wm Randolph and Akman, Varol",
      title = "Building an Octree from a Set of Parallelepipeds",
      booktitle = "Graphics Interface",
      year = "1985",
      precedes = "fa-bospj-85",
      keywords = "computer graphics, oct trees, CAD",
      mykey = "akman",
      href = "\bibhref{29-gi85-building}"
  }
  

• 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▼]

  @inproceedings{akman-robexs-85,
      author = "Akman, Varol and Franklin, W. Randolph",
      title = "Partitioning the Space to Calculate Shortest Paths to any Goal Around Polyhedral Obstacles",
      booktitle = "Proceedings of ROBEXS'85, the First Annual Workshop on Robotics and Expert Systems",
      address = "NASA/Johnson Space Center",
      month = "27--28 June",
      year = "1985",
      href = "\bibhref{32-robexs85-shortest}",
      mykey = "pathplan akman"
  }
  

• 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.
  [abstract▼] [details] [full text] [BibTeX▼]

  Algebraic and geometric algorithms are presented to solve the general and some specific instances of the following problem which is known as FINDPATH in artificial intelligence: "Given a set of polyhedra and two external points (source and goal), calculate the shortest path between these points under the Euclidean metric, constrained to avoid intersections with the given polyhedra." The shortest path is a polygonal path connecting the source and the goal, possibly bending at some edges of the given polyhedra while subtending equal entry and exit angles. The general problem can then be solved exactly using symbolic algebra and is based upon finding the real roots of a system of non-linear equations (stating the angular equality conditions) by elimination. If approximate solutions are acceptable this can also be done using numerical methods such as continuation, or using optimization methods to minimize a sum of square roots (expressing the length of the shortest path). In addition, two special cases are solved where there exists a single convex polyhedron, and the source and the goal are on its boundary or exterior. These solutions make use of planar developments of polyhedra and polyhedral visibility. Two Voronoi-based locus methods are also introduced to solve FINDPATH. These methods use preprocessing to speed up subsequent searches for a shortest path. The first method partitions the boundary of a convex polyhedron given only the source on it so that, for a later goal on the boundary, the shortest path is found efficiently. It makes use of standard point location algorithms for a straight-edge planar subdivision once the partitioning is done. The second method, currently more of a descriptive nature than algorithmic, is based on W. R. Franklin's "Partitioning the Plane to Calculate Minimal Paths to any Goal around Obstructions" Tech. Rep., ECSE Dept., Rensselaer Polytechnic Inst., Troy, NY, Nov. 1982 , and for a given source, partitions the free space around polyhedra into regions (bounded by high-order surfaces) so that the shortest paths for all goals in a given region follow the same sequence of edges of the given polyhedra. This method makes use of a recent spatial point location algorithm for arbitrary algebraic varieties. Finally, an overview of a workbench (called SP) which implements some of the above and thus allows experimentation with shortest paths is given.

  @phdthesis{akman-phd,
      author = "Akman, Varol",
      title = "Shortest paths avoiding polyhedral obstacles in 3-dimensional euclidean space",
      school = "Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute",
      year = "1985",
      mykey = "akman theses",
      note = "{UMI} abstract no. 85-28,651"
  }
  

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▼]

  @inproceedings{fa-spsgo-84,
      author = "Franklin, Wm Randolph and Akman, Varol",
      title = "Shortest Paths Between Source and Goal Points Located On/Around a Convex Polyhedron",
      booktitle = "22nd Annual Allerton Conference on Communication, Control, and Computing",
      month = "3--5 October",
      year = "1984",
      address = "Urbana, Illinois, USA",
      href = "\bibhref{26-allerton84-shortest}",
      mykey = "akman pathplan",
      keywords = "motion planning"
  }