Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a 
Given Point in th Plane

Elmasry, Amr; Elbassioni, Khaled

Local TagsRelease HistoryDetailsSummary

Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in th Plane

Elmasry, A., & Elbassioni, K. (2005). Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in th Plane. In 17th Canadian Conference on Computational Geometry (CCCG'05) (pp. 248-251). Windsor, Canada: University of Windsor.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2747-5 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0019-E97E-4

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Elmasry, Amr¹, Author
Elbassioni, Khaled¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2006-06-01Date issued: 2005

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 279128
Other: Local-ID: C1256428004B93B8-A4053F0D3F3C2FE5C125718000353812-Mal05

Degree: -

Event

show

hide

Title: CCCG 2005

Place of Event: Windsor, Canada

Start-/End Date: 2005-08-10

Legal Case

show

Project information

show

Source 1

show

hide

Title: 17th Canadian Conference on Computational Geometry (CCCG'05)

Abbreviation : CCCG 2005

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: Windsor, Canada : University of Windsor

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 248 - 251 Identifier: -