{"id":"https://openalex.org/W6888881126","doi":"https://doi.org/10.2312/sre.20181175","title":"Scalable Real-Time Shadows using Clustering and Metric Trees","display_name":"Scalable Real-Time Shadows using Clustering and Metric Trees","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W6888881126","doi":"https://doi.org/10.2312/sre.20181175"},"language":"en","primary_location":{"id":"doi:10.2312/sre.20181175","is_oa":true,"landing_page_url":"https://doi.org/10.2312/sre.20181175","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/sre.20181175","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Deves, Fran\u00e7ois","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Deves, Fran\u00e7ois","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Mora, Fr\u00e9d\u00e9ric","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mora, Fr\u00e9d\u00e9ric","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Aveneau, Lilian","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aveneau, Lilian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Ghazanfarpour, Djamchid","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ghazanfarpour, Djamchid","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.63822394,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.6118999719619751,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.6118999719619751,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.14110000431537628,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10799","display_name":"Data Visualization and Analytics","score":0.04969999939203262,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6485999822616577},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.569100022315979},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5231000185012817},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5040000081062317},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.48420000076293945},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.46860000491142273},{"id":"https://openalex.org/keywords/minimum-bounding-box","display_name":"Minimum bounding box","score":0.45489999651908875},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.4049000144004822},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.3991999924182892},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.3944999873638153}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6485999822616577},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.569100022315979},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5231000185012817},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.516700029373169},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5040000081062317},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.48420000076293945},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.46860000491142273},{"id":"https://openalex.org/C147037132","wikidata":"https://www.wikidata.org/wiki/Q6865426","display_name":"Minimum bounding box","level":3,"score":0.45489999651908875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4293000102043152},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.4049000144004822},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.3991999924182892},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.3944999873638153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38199999928474426},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3610000014305115},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.3529999852180481},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.35179999470710754},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.34860000014305115},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.31630000472068787},{"id":"https://openalex.org/C184585634","wikidata":"https://www.wikidata.org/wiki/Q1434060","display_name":"Bounding volume","level":4,"score":0.3028999865055084},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.302700012922287},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.3012000024318695},{"id":"https://openalex.org/C117797892","wikidata":"https://www.wikidata.org/wiki/Q286363","display_name":"Shadow (psychology)","level":2,"score":0.2962000072002411},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.2912999987602234},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.29089999198913574},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.2906000018119812},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.2897000014781952},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.27709999680519104},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2750999927520752},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2727000117301941},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.27239999175071716},{"id":"https://openalex.org/C72422203","wikidata":"https://www.wikidata.org/wiki/Q7392545","display_name":"SPHERES","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.2648000121116638},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C144986985","wikidata":"https://www.wikidata.org/wiki/Q871236","display_name":"Hierarchical database model","level":2,"score":0.25920000672340393},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2587999999523163},{"id":"https://openalex.org/C105611402","wikidata":"https://www.wikidata.org/wiki/Q2976589","display_name":"Spectral clustering","level":3,"score":0.25459998846054077}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2312/sre.20181175","is_oa":true,"landing_page_url":"https://doi.org/10.2312/sre.20181175","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.2312/sre.20181175","is_oa":true,"landing_page_url":"https://doi.org/10.2312/sre.20181175","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Real-time":[0],"shadow":[1,43],"algorithms":[2],"based":[3],"on":[4,28,35],"geometry":[5],"generally":[6],"produce":[7],"high":[8],"quality":[9],"shadows.":[10],"Recent":[11],"works":[12],"have":[13],"considerably":[14],"improved":[15],"their":[16,85],"efficiency.":[17],"However,":[18],"scalability":[19],"remains":[20,143],"an":[21,97],"issue":[22],"because":[23],"these":[24],"methods":[25],"strongly":[26],"depend":[27],"the":[29,50,79,89,103,106,118,126,130],"geometric":[30,51,119],"complexity.":[31,52],"This":[32],"paper":[33],"focuses":[34],"this":[36,92],"problem.":[37],"We":[38],"present":[39],"a":[40,73,133],"new":[41],"real-time":[42],"algorithm":[44],"for":[45,108],"non-deformable":[46],"models":[47,147],"that":[48,140],"scales":[49],"Our":[53,137],"method":[54],"groups":[55],"triangles":[56],"into":[57],"clusters":[58,131],"by":[59],"precomputing":[60],"bounding":[61,64,127],"spheres":[62,80],"or":[63],"capsules":[65,82],"(line-swept":[66],"spheres).":[67],"At":[68],"each":[69,109],"frame,":[70],"we":[71],"build":[72],"ternary":[74],"metric":[75,121],"tree":[76,93],"to":[77,84,101,115,124],"partition":[78],"and":[81],"according":[83],"apparent":[86],"distance":[87],"from":[88],"light.":[90],"Then,":[91],"is":[94],"used":[95],"as":[96],"acceleration":[98],"data":[99,135],"structure":[100],"determine":[102],"visibility":[104],"of":[105,129],"light":[107],"image":[110],"point.":[111],"While":[112],"clustering":[113],"allows":[114],"scale":[116],"down":[117],"complexity,":[120],"trees":[122],"allow":[123],"encode":[125],"volumes":[128],"in":[132],"hierarchical":[134],"structure.":[136],"experiments":[138],"show":[139],"our":[141],"approach":[142],"efficient,":[144],"including":[145],"with":[146,148],"over":[149],"70":[150],"million":[151],"triangles.":[152]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}