Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Ayellet Tal

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Sigal Ar

> Home > Persons > Ayellet Tal

Publications

2002
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/cgf/ArMT02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cgf/ArMT02
Sigal Ar, Gil Montag, Ayellet Tal:
Deferred, Self-Organizing BSP Trees. Comput. Graph. Forum 21(3): 269-278 (2002)
2001
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/egmm/EladTA01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/egmm/EladTA01
Michael Elad, Ayellet Tal, Sigal Ar:
Content Based Retrieval of VRML Objects - An Iterative and Interactive Approach. Eurographics Multimedia Workshop 2001: 107-118
2000
[j9]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/comgeo/ArCT00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/comgeo/ArCT00
Sigal Ar, Bernard Chazelle, Ayellet Tal:
Self-customized BSP trees for collision detection. Comput. Geom. 15(1-3): 91-102 (2000)
[i1]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/ewcg/ArT00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ewcg/ArT00
Sigal Ar, Ayellet Tal:
Query Driven BSP Trees. EuroCG 2000: 81-84

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.