View Issue Details

IDProjectCategoryView StatusLast Update
0005488The Dark ModCodingpublic08.01.2021 06:05
Reporterstgatilov Assigned Tostgatilov  
PrioritynormalSeverityfeatureReproducibilityN/A
Status assignedResolutionopen 
Product VersionTDM 2.09 
Target VersionTDM 2.10 
Summary0005488: dmap: faster optimize algorithm
DescriptionCurrently dmap "optimizes" all planar triangulations ("groups") to reduce number of triangles.
The underlying algorithm takes O(N^3) time and cannot be improved by a simple heuristic.
As the result, if the map has a complex planar surface in one area, the optimization algorithm can take ages.
It can also be disabled by passing noOpt argument to dmap, but this is a bad thing to do (aside from debugging).
Steps To ReproduceTo make it a big problem, you might want to :
1) Run entitylimit2.py in maps/test/ to generate a VERY LARGE map.
2) Try "dmap entitylimit2_gen.map" and see where execution chokes.
Note that there are other problems with such a huge map, so don't expect you will hit this problem first.
Additional InformationSee also:
  https://forums.thedarkmod.com/index.php?/topic/16837-when-youre-getting-close-to-the-entity-limit-inlining/&do=findComment&comment=454663
  https://forums.thedarkmod.com/index.php?/topic/16837-when-youre-getting-close-to-the-entity-limit-inlining/&do=findComment&comment=454721
TagsNo tags attached.

Activities

There are no notes attached to this issue.

Issue History

Date Modified Username Field Change
08.01.2021 06:05 stgatilov New Issue
08.01.2021 06:05 stgatilov Status new => assigned
08.01.2021 06:05 stgatilov Assigned To => stgatilov