comp.graphics.algorithms

• Date Index

---

• Algorithm for Load Cargo/Containers, GTM
• Re: Real world lighting...., dragonslayer008
• Casting rays through portals, andrew . fowler
  • Re: Casting rays through portals, fashnek
• approximating a surface with a spline, luca . pamparana
• Hexagonal symmetry, hoffmann
  • Re: Hexagonal symmetry, Vince Hradil
    • Re: Hexagonal symmetry, hoffmann
  • Re: Hexagonal symmetry, Kaba
    • Re: Hexagonal symmetry, hoffmann
      • Re: Hexagonal symmetry, Vince Hradil
      • Re: Hexagonal symmetry, Kaba
      • Re: Hexagonal symmetry, Kenneth Sloan
      • Re: Hexagonal symmetry, hoffmann
      • Re: Hexagonal symmetry, gatti
      • Re: Hexagonal symmetry, hoffmann
  • Re: Hexagonal symmetry, Claudio Grondi
    • Re: Hexagonal symmetry, hoffmann
      • Re: Hexagonal symmetry, Claudio Grondi
• Detecting overlaps or gaps between convex hulls, allnor
  • Re: Detecting overlaps or gaps between convex hulls, Dave Eberly
    • Re: Detecting overlaps or gaps between convex hulls, allnor
• Converting a 3D polyline to a smooth Nurbs curve, devDept
• transform normal, mast4as
  • Re: transform normal, Kaba
    • Re: transform normal, mast4as
      • Re: transform normal, Kaba
    • Re: transform normal, mast4as
      • Re: transform normal, Kaba
• picking a line, dragonslayer008
  • Re: picking a line, Ron Capelli
• APPLIED COMPUTING 2008 - Submission Deadline extended, natty2006@xxxxxxxxx
• Re: Don't say no, Bob Williamson
• Intersecting segments/rays with complex triangle surface meshes, pierre
  • Re: Intersecting segments/rays with complex triangle surface meshes, Dave Eberly
• exact point search, metoo
  • Re: exact point search, andreas.fabri
    • Re: exact point search, metoo
      • Re: exact point search, Kenneth Sloan
      • Re: exact point search, andreas.fabri
      • Re: exact point search, metoo
      • Re: exact point search, Kenneth Sloan
      • Re: exact point search, Meekohi
  • Re: exact point search, Kaba
• epipolar geometry: 7 or 8 points?, rfabbri
• Help finding the center of gravity, Bill
  • Re: Help finding the center of gravity, Dave Dodson
    • Re: Help finding the center of gravity, Meekohi
• Triangle-plane intersection code online?, jkj2000
  • Re: Triangle-plane intersection code online?, Kaba
  • Re: Triangle-plane intersection code online?, Eduardo
    • Re: Triangle-plane intersection code online?, Kaba
      • Re: Triangle-plane intersection code online?, Eduardo
      • Re: Triangle-plane intersection code online?, Kaba
  • Re: Triangle-plane intersection code online?, Kaba
    • Re: Triangle-plane intersection code online?, Kaba
• thinning algorithm in "Digital Image Processing" Gonzalez and Woods., cburns
• K nearest neighbours, Kaba
  • Re: K nearest neighbours, John Tsiombikas
    • Re: K nearest neighbours, tsh
    • Re: K nearest neighbours, Kaba
  • Re: K nearest neighbours, Kaba
    • Re: K nearest neighbours, Meekohi
      • Re: K nearest neighbours, Kaba
• How to determine whether a given NURBS curve represents a circular arc?, Matthias St.Pierre
• The limits of EGC, Denis
• Find the equivalent intersection point of multi lines in 3D space, Asm23
• Find the Smallest Closed Polygon from a Point., dallasyuan
  • Re: Find the Smallest Closed Polygon from a Point., tsh
• surface parametrization - terms confusion, jindra
  • Re: surface parametrization - terms confusion, Meekohi
  • Re: surface parametrization - terms confusion, Kaba
• NURBS arc between two points, Abdo Haji-Ali
  • Re: NURBS arc between two points, Dave Eberly
• Image Correlation, Godai
  • Re: Image Correlation, News Reader
    • Re: Image Correlation, Godai
• ActiveSolid Standard 2.5.6 freeware released, ds755
• Spline Fit Points, Nangi
  • Re: Spline Fit Points, Jack
    • Re: Spline Fit Points, Randolf Schultz
      • Re: Spline Fit Points, News Reader
• Finding smallest polygon around point, Qweertz
  • Re: Finding smallest polygon around point, Kenneth Sloan
  • Re: Finding smallest polygon around point, tsh
• Symposium "Image Processing and Analysis" within the ICCES'08 USA - Announce & Call for Papers, tavares@xxxxxxxx
• Parallelepiped coordinate system, chengiz
  • Re: Parallelepiped coordinate system, Kaba
  • Re: Parallelepiped coordinate system, Kenneth Sloan
• Copying a transparent 32 bit bitmap to the clipboard (on Windows), devDept
  • Re: Copying a transparent 32 bit bitmap to the clipboard (on Windows), Goodidea
    • Re: Copying a transparent 32 bit bitmap to the clipboard (on Windows), devDept
• What is the Keyword, handy . madinata
  • Re: What is the Keyword, Hans-Bernhard Bröker
• Post Your products!, Submit your products - Free for All
• similar/duplicate photos detection algorithm?, Bob Doe
• Neighbors of a Vertex, Sam
  • Re: Neighbors of a Vertex, News Reader
    • Re: Neighbors of a Vertex, Dave Eberly
      • Re: Neighbors of a Vertex, News Reader
• 3D Mean Shift Filter, Stefan Wundrak
• Data Structure : Meshing code, binesh
• detect the lips of someone's in a image file, Zeng Fucen
  • Re: detect the lips of someone's in a image file, Meekohi
  • Re: detect the lips of someone's in a image file, tsh
    • Re: detect the lips of someone's in a image file, Zeng Fucen
• Implementing "2D Larcher Pillichshammer random sequence", M Dobrogost
  • Re: Implementing "2D Larcher Pillichshammer random sequence", Dave Eberly
• Imagemagick for digital foto frame 480x234, OpaPiloot
• PBuffers and Multisampling, Michele Puccini
• triangulation algorithm for when neighborhood is already known, omlette
  • Re: triangulation algorithm for when neighborhood is already known, Kenneth Sloan
    • Re: triangulation algorithm for when neighborhood is already known, omlette
      • Re: triangulation algorithm for when neighborhood is already known, Kenneth Sloan
  • Re: triangulation algorithm for when neighborhood is already known, Meekohi
• Minimum Time Cost Problem - Dijkstra’s algorithm, Sam
  • Re: Minimum Time Cost Problem - Dijkstra’s algorithm, Sam
    • Re: Minimum Time Cost Problem - Dijkstra’s algorithm, Bob Williamson
• Shrink wrapping and hidden parts removal, M Dobrogost
  • Re: Shrink wrapping and hidden parts removal, Hans-Bernhard Bröker
    • Re: Shrink wrapping and hidden parts removal, Dave Eberly
      • Re: Shrink wrapping and hidden parts removal, M Dobrogost
    • Re: Shrink wrapping and hidden parts removal, M Dobrogost
      • Re: Shrink wrapping and hidden parts removal, Kenneth Sloan
      • Re: Shrink wrapping and hidden parts removal, Kaba
      • Re: Shrink wrapping and hidden parts removal, M Dobrogost
      • Re: Shrink wrapping and hidden parts removal, Kaba
      • Re: Shrink wrapping and hidden parts removal, Kaba
      • Re: Shrink wrapping and hidden parts removal, M Dobrogost
• convert list of adjacent pixels to arcs?, not_a_commie
  • Re: convert list of adjacent pixels to arcs?, Jeremy
    • Re: convert list of adjacent pixels to arcs?, not_a_commie
      • Re: convert list of adjacent pixels to arcs?, Jeremy
• Article on binary search trees, allnor
• Remove interior points from convex hull., Amit Bhatia
  • Re: Remove interior points from convex hull., Hans Raj Tiwary
  • Re: Remove interior points from convex hull., Dave Eberly
• Focusing rays in forward raytracing., nooga
  • Re: Focusing rays in forward raytracing., Lord Crc
• Re: Finding subimages, aruzinsky
• inverse squared law (lighting), dogbert1793
  • Re: inverse squared law (lighting), Hans-Bernhard Bröker
    • Re: inverse squared law (lighting), dogbert1793
      • Re: inverse squared law (lighting), Hans-Bernhard Bröker
      • Re: inverse squared law (lighting), Kaba
• Where is it? In 3D or 4D?, Clifford Nelson
  • Re: Where is it? In 3D or 4D?, Hans-Bernhard Bröker
    • Re: Where is it? In 3D or 4D?, Clifford Nelson
      • Re: Where is it? In 3D or 4D?, hoffmann
      • Re: Where is it? In 3D or 4D?, Hans-Bernhard Bröker
      • Re: Where is it? In 3D or 4D?, Clifford Nelson
      • Re: Where is it? In 3D or 4D?, Hans-Bernhard Bröker
      • Re: Where is it? In 3D or 4D?, Clifford Nelson
• Ray-tracing (but perhaps not quite as you know it), Richard
  • Re: Ray-tracing (but perhaps not quite as you know it), Richard
  • Re: Ray-tracing (but perhaps not quite as you know it), Hans-Bernhard Bröker
    • Re: Ray-tracing (but perhaps not quite as you know it), Richard
      • Re: Ray-tracing (but perhaps not quite as you know it), Miles Bader
      • Re: Ray-tracing (but perhaps not quite as you know it), Richard
      • Re: Ray-tracing (but perhaps not quite as you know it), Richard
• Triangle warping algorithm ?, Michel
  • Re: Triangle warping algorithm ?, Kaba
  • Re: Triangle warping algorithm ?, Kenneth Sloan
    • Re: Triangle warping algorithm ?, Kaba
      • Re: Triangle warping algorithm ?, Michel
      • Re: Triangle warping algorithm ?, Kaba
• Finding Representative Hue/Saturation Values In A Given Rectangle, SMurf
  • Re: Finding Representative Hue/Saturation Values In A Given Rectangle, Hans-Bernhard Bröker
• Logarithmic Axis, Frank
  • Re: Logarithmic Axis, Armin
    • Re: Logarithmic Axis, Ronald Maldonado
    • Re: Logarithmic Axis, Frank
      • Re: Logarithmic Axis, Armin
      • Re: Logarithmic Axis, Frank
      • Re: Logarithmic Axis, Armin
      • Re: Logarithmic Axis, Frank
      • Re: Logarithmic Axis, Kenneth Sloan
      • Re: Logarithmic Axis, Armin
• Artists Added to "Phantasies and Phractals", vadis
• one or two or .... parameters, Ericsson
  • Re: one or two or .... parameters, tsh
• How to calculate the final quaternion values on the end points?, Jacky
  • Re: How to calculate the final quaternion values on the end points?, Jacky
  • Re: How to calculate the final quaternion values on the end points?, Jacky
  • Re: How to calculate the final quaternion values on the end points?, John Nagle
    • Re: How to calculate the final quaternion values on the end points?, Jacky
      • Re: How to calculate the final quaternion values on the end points?, Jacky
• Re: HSB, HSV, HSI, 4N

• Security
• UNIX
• Linux
• Coding
• Usenet

• Archive
• About
• Privacy
• Search
• Imprint

newsgroups.derkeiler.com  > Archive  > Comp  > comp.graphics.algorithms  > 2007-11