Search Results - "Gotsman, C"

Refine Results
  1. 1

    On Landmark Distances in Polygons by Gotsman, C., Hormann, K.

    Published in Computer graphics forum (01-08-2021)
    “…We study the landmark distance function between two points in a simply connected planar polygon. We show that if the polygon vertices are used as landmarks,…”
    Get full text
    Journal Article
  2. 2

    Energy-Based Image Deformation by Karni, Z., Freedman, D., Gotsman, C.

    Published in Computer graphics forum (01-07-2009)
    “…We present a general approach to shape deformation based on energy minimization, and applications of this approach to the problems of image resizing and 2D…”
    Get full text
    Journal Article
  3. 3

    A Complex View of Barycentric Mappings by Weber, O., Ben-Chen, M., Gotsman, C., Hormann, K.

    Published in Computer graphics forum (01-08-2011)
    “…Barycentric coordinates are very popular for interpolating data values on polyhedral domains. It has been recently shown that expressing them as complex…”
    Get full text
    Journal Article
  4. 4

    3D Surface Reconstruction Using a Generalized Distance Function by Poranne, R., Gotsman, C., Keren, D.

    Published in Computer graphics forum (01-12-2010)
    “…We define a generalized distance function on an unoriented 3D point set and describe how it may be used to reconstruct a surface approximating these points…”
    Get full text
    Journal Article
  5. 5

    On the metric properties of discrete space-filling curves by Gotsman, C., Lindenbaum, M.

    Published in IEEE transactions on image processing (01-05-1996)
    “…A space-filling curve is a linear traversal of a discrete finite multidimensional space. In order for this traversal to be useful in many applications, the…”
    Get full text
    Journal Article
  6. 6

    Universal Rendering Sequences for Transparent Vertex Caching of Progressive Meshes by Bogomjakov, A., Gotsman, C.

    Published in Computer graphics forum (01-06-2002)
    “…We present methods to generate rendering sequences for triangle meshes which preserve mesh locality as much as possible. This is useful for maximizing vertex…”
    Get full text
    Journal Article
  7. 7

    Antifaces: a novel, fast method for image detection by Keren, D., Osadchy, M., Gotsman, C.

    “…This paper offers a novel detection method, which works well even in the case of a complicated image collection. It can also be applied to detect 3D objects…”
    Get full text
    Journal Article
  8. 8

    Fitting curves and surfaces with constrained implicit polynomials by Keren, D., Gotsman, C.

    “…A problem which often arises while fitting implicit polynomials to 2D and 3D data sets is the following: although the data set is simple, the fit exhibits…”
    Get full text
    Journal Article
  9. 9

    Robust spherical parameterization of triangular meshes by SHEFFER, A, GOTSMAN, C, DYN, N

    Published in Computing (01-04-2004)
    “…Parameterization of 3D mesh data is important for many graphics and mesh processing applications, in particular for texture mapping, remeshing and morphing…”
    Get full text
    Journal Article
  10. 10

    High quality compatible triangulations by Surazhsky, V, Gotsman, C

    Published in Engineering with computers (01-07-2004)
    “…Compatible meshes are isomorphic meshings of the interiors of two polygons having a correspondence between their vertices. Compatible meshing may be used for…”
    Get full text
    Journal Article
  11. 11

    Enhancement by image-dependent warping by Arad, N., Gotsman, C.

    “…All image warping algorithms to date are image-independent, namely, relate only to the geometry of the image plane, ignoring the content of the image. We show…”
    Get full text
    Journal Article
  12. 12

    Dynamic scene occlusion culling by Sudarsky, O., Gotsman, C.

    “…Large, complex 3D scenes are best rendered in an output-sensitive way, i.e., in time largely independent of the entire scene model's complexity. Occlusion…”
    Get full text
    Journal Article
  13. 13

    Connectivity shapes by Isenburg, M., Gumhold, S., Gotsman, C.

    “…We describe a method to visualize the connectivity graph of a mesh using a natural embedding in 3D space. This uses a 3D shape representation that is based…”
    Get full text
    Conference Proceeding
  14. 14

    Efficient coding of non-triangular mesh connectivity by Kronrod, B., Gotsman, C.

    “…Describes an efficient algorithm for coding the connectivity information of general polygon meshes. In contrast to most existing algorithms, which are suitable…”
    Get full text
    Conference Proceeding
  15. 15

    D-Snake: Image Registration by As-Similar-As-Possible Template Deformation by Levi, Z., Gotsman, C.

    “…We describe a snake-type method for shape registration in 2D and 3D, by fitting a given polygonal template to an acquired image or volume data. The snake…”
    Get full text
    Journal Article
  16. 16

    Optimized triangle mesh compression using prediction trees by Kronrod, B., Gotsman, C.

    “…Recently, a wealth of algorithms for the efficient coding of 3D triangle meshes have been published. All these focus on achieving the most compact code for the…”
    Get full text
    Conference Proceeding
  17. 17

    Dynamic color quantization of video sequences by Roytman, E., Gotsman, C.

    “…We present an efficient algorithm for dynamic adaptive color quantization of 24 bit image (video) sequences, important in multimedia applications. Besides…”
    Get full text
    Journal Article
  18. 18

    Morphing stick figures using optimized compatible triangulations by Surazhsky, V., Gotsman, C.

    “…A "stick figure" is a connected straight-line plane graph, sometimes called a "skeleton". Compatible stick figures are those with the same topological…”
    Get full text
    Conference Proceeding
  19. 19
  20. 20